- Sort Score
- Result 10 results
- Languages All
Results 1 - 7 of 7 for AddEdge (0.1 sec)
-
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: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Thu Apr 25 05:46:50 UTC 2024 - 4.7K bytes - Viewed (0) -
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: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Thu Apr 25 05:46:50 UTC 2024 - 8.1K bytes - Viewed (0) -
maven-api-impl/src/main/java/org/apache/maven/internal/impl/model/DefaultModelTransformerContextBuilder.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: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Fri Apr 12 10:50:18 UTC 2024 - 9.3K bytes - Viewed (0) -
src/internal/dag/parse.go
if _, ok := g.byLabel[label]; ok { return false } g.byLabel[label] = len(g.Nodes) g.Nodes = append(g.Nodes, label) g.edges[label] = map[string]bool{} return true } func (g *Graph) AddEdge(from, to string) { g.edges[from][to] = true } func (g *Graph) DelEdge(from, to string) { delete(g.edges[from], to) } func (g *Graph) HasEdge(from, to string) bool {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 6.7K bytes - Viewed (0) -
maven-api-impl/src/main/java/org/apache/maven/internal/impl/model/Graph.java
import java.util.LinkedList; import java.util.List; import java.util.Map; import java.util.Set; 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: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Fri Apr 12 10:50:18 UTC 2024 - 3.3K bytes - Viewed (0) -
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: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Fri Apr 12 10:50:18 UTC 2024 - 4.5K bytes - Viewed (0) -
src/runtime/mklockrank.go
if err != nil { log.Fatal(err) } var out []byte if *flagDot { var b bytes.Buffer g.TransitiveReduction() // Add cyclic edges for visualization. for k := range cyclicRanks { g.AddEdge(k, k) } // Reverse the graph. It's much easier to read this as // a "<" partial order than a ">" partial order. This // ways, locks are acquired from the top going down
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 08 17:47:01 UTC 2024 - 9.1K bytes - Viewed (0)