- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 265 for Edges (0.06 sec)
-
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) -
tensorflow/compiler/jit/shape_inference_helpers.h
BackEdgeHelper& operator=(const BackEdgeHelper& other) = delete; // Temporarily removes all the back edges in graph. Status Remove(Graph* graph); // Gets the list of removed edges. const std::vector<BackEdge>& RemovedEdges() const; // Replaces the back edges removed by a prior call to Remove. Status Replace(); private: Graph* graph_ = nullptr; // not owned
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 12 18:06:51 UTC 2018 - 2.2K bytes - Viewed (0) -
guava/src/com/google/common/graph/AbstractGraph.java
return false; } Graph<?> other = (Graph<?>) obj; return isDirected() == other.isDirected() && nodes().equals(other.nodes()) && edges().equals(other.edges()); } @Override public final int hashCode() { return edges().hashCode(); } /** Returns a string representation of this graph. */ @Override public String toString() { return "isDirected: "
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 26 17:43:39 UTC 2021 - 1.8K 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) -
guava/src/com/google/common/graph/NetworkConnections.java
Set<N> predecessors(); Set<N> successors(); Set<E> incidentEdges(); Set<E> inEdges(); Set<E> outEdges(); /** * Returns the set of edges connecting the origin node to {@code node}. For networks without * parallel edges, this set cannot be of size greater than one. */ Set<E> edgesConnecting(N node); /** * Returns the node that is adjacent to the origin node along {@code edge}. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 26 17:43:39 UTC 2021 - 2.3K 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) -
platforms/native/language-native/src/test/groovy/org/gradle/language/nativeplatform/internal/incremental/CompilationStateSerializerTest.groovy
emptyCompileState.hash == TestHashCodes.hashCodeFrom(0x12345678) emptyCompileState.edges == stateOne.edges def otherCompileState = newState.getState(fileTwo) otherCompileState.hash == TestHashCodes.hashCodeFrom(0x23456789) otherCompileState.edges == stateTwo.edges } private SourceFileState compilationFileState(HashCode hash, Collection<String> includes) {
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Nov 16 20:20:03 UTC 2023 - 3.6K bytes - Viewed (0) -
maven-compat/src/main/java/org/apache/maven/repository/metadata/DefaultGraphConflictResolver.java
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Wed Sep 06 11:28:54 UTC 2023 - 8.2K bytes - Viewed (0) -
tensorflow/compiler/jit/resource_operation_safety_analysis.h
// -> ReadVariableOp1 and AssignVariableOp0 -> AssignVariableOp1 edges will be // respected by XlaLaunchOp though because all reads happen before all writes // with that limited clustering.. // // // NB! The result computed by this analysis assumes that we don't auto-cluster // back-edges (i.e. the edges from NextIteration to Merge). //
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Sep 06 19:12:29 UTC 2023 - 3.2K bytes - Viewed (0)