- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 11 for addEdge (0.12 sec)
-
compat/maven-model-builder/src/main/java/org/apache/maven/model/building/DefaultTransformerContextBuilder.java
// gathered with problem collector } return null; } }; } private boolean addEdge(Path from, Path p, DefaultModelProblemCollector problems) { try { dag.addEdge(from.toString(), p.toString()); return true; } catch (Graph.CycleDetectedException e) { problems.add(new DefaultModelProblem(
Registered: Sun Nov 03 03:35:11 UTC 2024 - Last Modified: Fri Oct 25 12:31:46 UTC 2024 - 9.1K bytes - Viewed (0) -
impl/maven-core/src/main/java/org/apache/maven/internal/impl/DefaultLifecycleRegistry.java
Registered: Sun Nov 03 03:35:11 UTC 2024 - Last Modified: Fri Oct 25 12:31:46 UTC 2024 - 19.4K bytes - Viewed (0) -
compat/maven-compat/src/test/java/org/apache/maven/repository/metadata/DefaultClasspathTransformationTestType.java
// v1-->v2 graph.addEdge(v1, v2, new MetadataGraphEdge("1.1", true, null, null, 2, 1)); graph.addEdge(v1, v2, new MetadataGraphEdge("1.2", true, null, null, 2, 2)); // v1-->v3 graph.addEdge(v1, v3, new MetadataGraphEdge("1.1", true, null, null, 2, 1)); graph.addEdge(v1, v3, new MetadataGraphEdge("1.2", true, null, null, 4, 2)); // v3-->v4
Registered: Sun Nov 03 03:35:11 UTC 2024 - Last Modified: Fri Oct 25 12:31:46 UTC 2024 - 4.7K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/NetworkEquivalenceTest.java
// for ug1, add e12 first, then e12_a g1.addEdge(N1, N2, E12); g1.addEdge(N1, N2, E12_A); // for ug2, add e12_a first, then e12 g2.addEdge(N1, N2, E12_A); g2.addEdge(N1, N2, E12); assertThat(g1).isEqualTo(g2); } @Test public void equivalent_edgeDirectionsDiffer() { network.addEdge(N1, N2, E12);
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Oct 16 17:21:56 UTC 2024 - 5.8K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/NetworkEquivalenceTest.java
// for ug1, add e12 first, then e12_a g1.addEdge(N1, N2, E12); g1.addEdge(N1, N2, E12_A); // for ug2, add e12_a first, then e12 g2.addEdge(N1, N2, E12_A); g2.addEdge(N1, N2, E12); assertThat(g1).isEqualTo(g2); } @Test public void equivalent_edgeDirectionsDiffer() { network.addEdge(N1, N2, E12);
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Oct 16 17:21:56 UTC 2024 - 5.8K bytes - Viewed (0) -
compat/maven-compat/src/test/java/org/apache/maven/repository/metadata/DefaultGraphConflictResolverTest.java
// v1-->v2 graph.addEdge(v1, v2, new MetadataGraphEdge("1.1", true, null, null, 2, 1)); graph.addEdge(v1, v2, new MetadataGraphEdge("1.2", true, null, null, 2, 2)); // v1-->v3 graph.addEdge(v1, v3, new MetadataGraphEdge("1.1", true, null, null, 2, 1)); graph.addEdge(v1, v3, new MetadataGraphEdge("1.2", true, null, null, 4, 2)); // v3-->v4
Registered: Sun Nov 03 03:35:11 UTC 2024 - Last Modified: Fri Oct 25 12:31:46 UTC 2024 - 8.1K bytes - Viewed (0) -
compat/maven-model-builder/src/test/java/org/apache/maven/model/building/GraphTest.java
public class GraphTest { @Test void testCycle() throws Graph.CycleDetectedException { Graph graph = new Graph(); graph.addEdge("a1", "a2"); assertThrows(Graph.CycleDetectedException.class, () -> graph.addEdge("a2", "a1")); } @Test public void testPerf() throws IOException { List<String[]> data = new ArrayList<>(); String k = null;
Registered: Sun Nov 03 03:35:11 UTC 2024 - Last Modified: Fri Oct 25 12:31:46 UTC 2024 - 2.1K bytes - Viewed (0) -
compat/maven-compat/src/main/java/org/apache/maven/repository/metadata/MetadataGraph.java
{ ArtifactMetadata md = node.getMd(); MetadataGraphEdge e = new MetadataGraphEdge(md.version, md.resolved, md.artifactScope, md.artifactUri, depth, pomOrder); addEdge(parentVertex, vertex, e); } else { entry = vertex; } MetadataTreeNode[] kids = node.getChildren(); if (kids == null || kids.length < 1) { return;
Registered: Sun Nov 03 03:35:11 UTC 2024 - Last Modified: Fri Oct 25 12:31:46 UTC 2024 - 13.1K bytes - Viewed (0) -
compat/maven-model-builder/src/main/java/org/apache/maven/model/building/Graph.java
* @deprecated use {@link org.apache.maven.api.services.ModelBuilder} instead */ @Deprecated(since = "4.0.0") class Graph { final Map<String, Set<String>> graph = new LinkedHashMap<>(); synchronized void addEdge(String from, String to) throws CycleDetectedException { if (graph.computeIfAbsent(from, l -> new HashSet<>()).add(to)) {
Registered: Sun Nov 03 03:35:11 UTC 2024 - Last Modified: Fri Oct 25 12:31:46 UTC 2024 - 3.4K bytes - Viewed (0) -
impl/maven-core/src/main/java/org/apache/maven/internal/impl/Graph.java
public Collection<Vertex> getVertices() { return vertices.values(); } Vertex addVertex(String label) { return vertices.computeIfAbsent(label, Vertex::new); } void addEdge(Vertex from, Vertex to) throws CycleDetectedException { from.children.add(to); to.parents.add(from); List<String> cycle = findCycle(to); if (cycle != null) {
Registered: Sun Nov 03 03:35:11 UTC 2024 - Last Modified: Fri Oct 25 12:31:46 UTC 2024 - 4.6K bytes - Viewed (0)