- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 120 for Edges (0.1 sec)
-
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 - 16K bytes - Viewed (0) -
guava/src/com/google/common/graph/Graphs.java
&& network.allowsParallelEdges() && network.edges().size() > network.asGraph().edges().size()) { return true; } return hasCycle(network.asGraph()); } /** * Performs a traversal of the nodes reachable from {@code node}. If we ever reach a node we've * already visited (following only outgoing edges and without reusing edges), we know there's a * cycle in the graph. */
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 21.7K bytes - Viewed (0) -
android/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) -
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) -
plugin/pkg/auth/authorizer/node/graph.go
g.removeVertex_locked(neighbor.(*namedVertex)) } // remove edges from destination indexes for neighbors that dropped outbound edges for _, edge := range edgesToRemoveFromIndexes { g.removeEdgeFromDestinationIndex_locked(edge) } } // must be called under write lock // deletes edges from a given vertex type to a specific vertex
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Mar 07 21:22:55 UTC 2024 - 17.5K 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/types2/mono.go
// declaration "type T int", we construct edges T<-A and T<-B with // weight 1; and because of instantiation "f[T, map[A]B]" we construct // edges A<-T with weight 0, and B<-A and B<-B with weight 1. // // Finally, we look for any positive-weight cycles. Zero-weight cycles // are allowed because static instantiation will reach a fixed point. type monoGraph struct { vertices []monoVertex edges []monoEdge
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Feb 28 00:05:29 UTC 2024 - 9.1K bytes - Viewed (0) -
platforms/software/dependency-management/src/main/java/org/gradle/api/internal/artifacts/ivyservice/resolveengine/graph/builder/NodeState.java
// If none of the incoming edges are transitive, remove previous state and do not traverse. // If not traversed before, simply add all selected outgoing edges (either hard or pending edges) // If traversed before: // If net exclusions for this node have not changed, ignore // If net exclusions for this node have changed, remove previous state and traverse outgoing edges again.
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Jun 07 14:19:34 UTC 2024 - 58.9K bytes - Viewed (0) -
src/go/types/mono.go
// declaration "type T int", we construct edges T<-A and T<-B with // weight 1; and because of instantiation "f[T, map[A]B]" we construct // edges A<-T with weight 0, and B<-A and B<-B with weight 1. // // Finally, we look for any positive-weight cycles. Zero-weight cycles // are allowed because static instantiation will reach a fixed point. type monoGraph struct { vertices []monoVertex edges []monoEdge
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Apr 03 18:48:38 UTC 2024 - 9.2K bytes - Viewed (0)