- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 265 for Edges (0.04 sec)
-
src/internal/dag/alg.go
// license that can be found in the LICENSE file. package dag // Transpose reverses all edges in g. func (g *Graph) Transpose() { old := g.edges g.edges = make(map[string]map[string]bool) for _, n := range g.Nodes { g.edges[n] = make(map[string]bool) } for from, tos := range old { for to := range tos { g.edges[to][from] = true } } }
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/cmd/link/internal/ld/inittask.go
} // Find all incoming edges into s. a := sort.Search(len(edges), func(i int) bool { return edges[i].to >= s }) b := sort.Search(len(edges), func(i int) bool { return edges[i].to > s }) // Decrement the import count for all packages that import s. // If the count reaches 0, that package is now ready to schedule. for _, e := range edges[a:b] { m[e.from]-- if m[e.from] == 0 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jan 30 20:09:45 UTC 2024 - 6.2K bytes - Viewed (0) -
maven-compat/src/test/java/org/apache/maven/repository/metadata/DefaultGraphConflictResolverTest.java
assertNotNull(res.getExcidentEdges(v1), "no edges in the resulting graph after resolver"); assertEquals(4, res.getVertices().size(), "wrong # of vertices in the resulting graph after resolver"); assertEquals( 2, res.getExcidentEdges(v1).size(), "wrong # of excident edges in the resulting graph entry after resolver"); assertEquals(
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Thu Apr 25 05:46:50 UTC 2024 - 8.1K bytes - Viewed (0) -
guava/src/com/google/common/graph/Network.java
* terms</a>): * * <ul> * <li>directed graphs * <li>undirected graphs * <li>graphs that do/don't allow parallel edges * <li>graphs that do/don't allow self-loops * <li>graphs whose nodes/edges are insertion-ordered, sorted, or unordered * <li>graphs whose edges are unique objects * </ul> * * <h3>Building a {@code Network}</h3> *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 22.3K bytes - Viewed (0) -
src/cmd/link/internal/ld/stackcheck.go
// Compute and record the height and optionally edges. h, edges := sc.computeHeight(sym, *flagDebugNosplit || sc.graph != nil) if h > int(stackCheckCycle) { // Prevent integer overflow h = int(stackCheckCycle) } sc.height[sym] = int16(h) if sc.graph != nil { sc.graph[sym] = edges } if *flagDebugNosplit { for _, edge := range edges { fmt.Printf("nosplit: %s +%d", sc.symName(sym), edge.growth)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 24 16:49:08 UTC 2023 - 11.9K bytes - Viewed (0) -
src/internal/trace/mud.go
return math.NaN(), false } // Sort edges. edges := d.unsorted slices.SortFunc(edges, func(a, b edge) int { return cmp.Compare(a.x, b.x) }) // Merge with sorted edges. d.unsorted = nil if d.sorted == nil { d.sorted = edges } else { oldSorted := d.sorted newSorted := make([]edge, len(oldSorted)+len(edges)) i, j := 0, 0 for o := range newSorted {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 5.7K bytes - Viewed (0) -
src/internal/dag/parse.go
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 { return g.edges[from] != nil && g.edges[from][to] } func (g *Graph) Edges(from string) []string { edges := make([]string, 0, 16) for k := range g.edges[from] { edges = append(edges, k) } slices.SortFunc(edges, func(a, b string) int {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 6.7K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ValueGraph.java
* <li>graphs that do/don't allow self-loops * <li>graphs whose nodes/edges are insertion-ordered, sorted, or unordered * <li>graphs whose edges have associated values * </ul> * * <p>{@code ValueGraph}, as a subtype of {@code Graph}, explicitly does not support parallel edges, * and forbids implementations or extensions with parallel edges. If you need parallel edges, use
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 15K bytes - Viewed (0) -
tensorflow/compiler/jit/encapsulate_util.cc
// Other edge in `edges` might have `e->dst()` as src or dst // node. Before removing `e->dst()`, replace those edges with // corresponding edges for `dst_replace_node`. for (int j = i + 1, end = edges.size(); j < end; j++) { if (edges[j].dst_node_id == edges[i].dst_node_id) { edges[j].dst_node_id = dst_replace_node->id(); } } }
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Mar 12 06:33:33 UTC 2024 - 15.5K bytes - Viewed (0) -
pkg/controller/garbagecollector/dump.go
nodes = append(nodes, currOwnerVertex) } edges = append(edges, dotEdge{F: currVertex.uid, T: currOwnerVertex.uid}) } } sort.SliceStable(nodes, func(i, j int) bool { return nodes[i].uid < nodes[j].uid }) sort.SliceStable(edges, func(i, j int) bool { if edges[i].F != edges[j].F { return edges[i].F < edges[j].F } return edges[i].T < edges[j].T }) return nodes, edges }
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Sep 23 17:12:33 UTC 2022 - 9.5K bytes - Viewed (0)