- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 99 for Edges (0.04 sec)
-
guava/src/com/google/common/graph/Graph.java
@Override Set<N> nodes(); /** Returns all edges in this graph. */ @Override Set<EndpointPair<N>> edges(); // // Graph properties // /** * Returns true if the edges in this graph are directed. Directed edges connect a {@link * EndpointPair#source() source node} to a {@link EndpointPair#target() target node}, while * undirected edges connect a pair of nodes to each other. */
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 13.6K bytes - Viewed (0) -
android/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 - 21.1K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/schedule.go
b.Values = append(b.Values, v) // Find all the scheduling edges out from this value. i := sort.Search(len(edges), func(i int) bool { return edges[i].x.ID >= v.ID }) j := sort.Search(len(edges), func(i int) bool { return edges[i].x.ID > v.ID }) // Decrement inEdges for each target of edges from v. for _, e := range edges[i:j] { inEdges[e.y.ID]-- if inEdges[e.y.ID] == 0 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 08 15:53:17 UTC 2024 - 16.4K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/sccp.go
// build it early since we rely heavily on the def-use chain later t.buildDefUses() // pick up either an edge or SSA value from worklist, process it for { if len(t.edges) > 0 { edge := t.edges[0] t.edges = t.edges[1:] if _, exist := t.visited[edge]; !exist { dest := edge.b destVisited := t.visitedBlock[dest.ID] // mark edge as visited t.visited[edge] = true
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jan 22 16:54:50 UTC 2024 - 17.6K bytes - Viewed (0) -
.github/actions/people/app/main.py
) def get_individual_sponsors(settings: Settings): nodes: List[SponsorshipAsMaintainerNode] = [] edges = get_graphql_sponsor_edges(settings=settings) while edges: for edge in edges: nodes.append(edge.node) last_edge = edges[-1] edges = get_graphql_sponsor_edges(settings=settings, after=last_edge.cursor)
Registered: Mon Jun 17 08:32:26 UTC 2024 - Last Modified: Tue Mar 26 17:38:21 UTC 2024 - 19.2K bytes - Viewed (0) -
tensorflow/compiler/jit/resource_operation_safety_analysis.cc
// enforce arbitrary ordering dependencies (via control or data edges) between // resource operations. Since all resource reads happen before all resource // writes, edges constraining resource reads to happen before resource writes // are fine, but all other kinds of edges are problematic. This analysis // computes the set of pairs of resource operations that cannot be put in the
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Fri Feb 09 11:36:41 UTC 2024 - 11.2K bytes - Viewed (0) -
platforms/native/language-native/src/main/java/org/gradle/language/nativeplatform/internal/incremental/IncrementalCompileFilesFactory.java
this.included = included; this.edges = edges; this.includeFileDirectives = dependentIncludeDirectives; } FileVisitResult(File file) { this.file = file; result = IncludeFileResolutionResult.NoMacroIncludes; includeDirectives = null; included = Collections.emptyList(); edges = Collections.emptyList();
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Nov 16 20:20:03 UTC 2023 - 14.6K bytes - Viewed (0) -
plugin/pkg/auth/authorizer/node/graph_test.go
g.getOrCreateVertex_locked(nodeVertexType, "", "node1") return g }(), }, { // two edges from the same configmap to distinct nodes, will delete one of the edges desc: "edges are deleted, non-orphans and destination orphans are preserved", fromType: configMapVertexType, toType: nodeVertexType, toNamespace: "", toName: "node2",
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Sep 23 23:14:19 UTC 2022 - 12.3K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/AbstractNetwork.java
return AbstractNetwork.this.nodes(); } @Override public Set<EndpointPair<N>> edges() { if (allowsParallelEdges()) { return super.edges(); // Defer to AbstractGraph implementation. } // Optimized implementation assumes no parallel edges (1:1 edge to EndpointPair mapping). return new AbstractSet<EndpointPair<N>>() { @Override
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Mar 13 18:17:09 UTC 2024 - 10.1K bytes - Viewed (0) -
guava/src/com/google/common/graph/AbstractNetwork.java
return AbstractNetwork.this.nodes(); } @Override public Set<EndpointPair<N>> edges() { if (allowsParallelEdges()) { return super.edges(); // Defer to AbstractGraph implementation. } // Optimized implementation assumes no parallel edges (1:1 edge to EndpointPair mapping). return new AbstractSet<EndpointPair<N>>() { @Override
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Mar 13 18:17:09 UTC 2024 - 10.4K bytes - Viewed (0)