- Sort Score
- Result 10 results
- Languages All
Results 1 - 4 of 4 for HasEdge (0.19 sec)
-
maven-core/src/test/java/org/apache/maven/project/GraphTest.java
assertTrue(hasEdge(graph5, "a", "b")); assertTrue(hasEdge(graph5, "b", "c")); assertTrue(hasEdge(graph5, "b", "f")); assertTrue(hasEdge(graph5, "f", "g")); assertTrue(hasEdge(graph5, "g", "h")); assertTrue(hasEdge(graph5, "c", "d")); assertTrue(hasEdge(graph5, "d", "e")); assertFalse(hasEdge(graph5, "e", "b")); } @Test
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Fri Sep 22 06:02:04 UTC 2023 - 8.3K bytes - Viewed (0) -
src/internal/dag/alg.go
func (g *Graph) TransitiveReduction() { // For i -> j -> k, if i -> k exists, delete it. for _, i := range g.Nodes { for _, j := range g.Nodes { if g.HasEdge(i, j) { for _, k := range g.Nodes { if g.HasEdge(j, k) { g.DelEdge(i, k) } } } } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Aug 04 15:31:44 UTC 2022 - 1.3K bytes - Viewed (0) -
src/internal/dag/parse.go
} } } // Complete transitive closure. for _, k := range g.Nodes { for _, i := range g.Nodes { for _, j := range g.Nodes { if i != k && k != j && g.HasEdge(i, k) && g.HasEdge(k, j) { if i == j { // Can only happen along with a "use of X before deps" error above, // but this error is more specific - it makes clear that reordering the
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 6.7K bytes - Viewed (0) -
src/internal/dag/parse_test.go
wantEdges := strings.Fields(edges) wantEdgeMap := make(map[string]bool) for _, e := range wantEdges { wantEdgeMap[e] = true } for _, n1 := range g.Nodes { for _, n2 := range g.Nodes { got := g.HasEdge(n1, n2) want := wantEdgeMap[n1+"->"+n2] if got && want { t.Logf("%s->%s", n1, n2) } else if got && !want { t.Errorf("%s->%s present but not expected", n1, n2) } else if want && !got {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Aug 04 15:31:42 UTC 2022 - 1.3K bytes - Viewed (0)