- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 379 for graaph (0.4 sec)
-
android/guava/src/com/google/common/graph/DirectedGraphConnections.java
* limitations under the License. */ package com.google.common.graph; import static com.google.common.base.Preconditions.checkArgument; import static com.google.common.base.Preconditions.checkNotNull; import static com.google.common.base.Preconditions.checkState; import static com.google.common.graph.GraphConstants.INNER_CAPACITY; import static com.google.common.graph.GraphConstants.INNER_LOAD_FACTOR;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Feb 20 17:00:05 GMT 2024 - 18K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/PredecessorsFunction.java
*/ package com.google.common.graph; import com.google.common.annotations.Beta; import com.google.errorprone.annotations.DoNotMock; /** * A functional interface for <a * href="https://en.wikipedia.org/wiki/Graph_(discrete_mathematics)">graph</a>-structured data. * * <p>This interface is meant to be used as the type of a parameter to graph algorithms (such as
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 4.1K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/ElementOrderTest.java
assertThat(graph.nodeOrder().comparator()).isEqualTo(Ordering.natural()); assertThat(graph.nodes()).containsExactly(node2, node4, node6, node8).inOrder(); } private static void addNodes(MutableGraph<Integer> graph) { graph.addNode(3); graph.addNode(1); graph.addNode(4); } private static void addEdges(MutableNetwork<Integer, String> network) { network.addEdge(3, 1, "i");
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 8.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/StandardMutableGraph.java
* See the License for the specific language governing permissions and * limitations under the License. */ package com.google.common.graph; import com.google.common.graph.GraphConstants.Presence; /** * Standard implementation of {@link MutableGraph} that supports both directed and undirected * graphs. Instances of this class should be constructed with {@link GraphBuilder}. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 2.4K bytes - Viewed (0) -
tensorflow/c/c_api_internal.h
// will eventually contain the full while loop. TF_Graph* parent; TF_Output* parent_inputs; }; struct TF_OperationDescription { TF_OperationDescription(TF_Graph* g, const char* op_type, const char* node_name) : node_builder(node_name, op_type, g->graph.op_registry()), graph(g) {} tensorflow::NodeBuilder node_builder; TF_Graph* graph;
C - Registered: Tue Apr 30 12:39:09 GMT 2024 - Last Modified: Sat May 13 00:49:12 GMT 2023 - 7.6K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/ValueGraphTest.java
MutableValueGraph<Integer, String> graph; @After public void validateGraphState() { assertStronglyEquivalent(graph, Graphs.copyOf(graph)); assertStronglyEquivalent(graph, ImmutableValueGraph.copyOf(graph)); Graph<Integer> asGraph = graph.asGraph(); AbstractGraphTest.validateGraph(asGraph); assertThat(graph.nodes()).isEqualTo(asGraph.nodes()); assertThat(graph.edges()).isEqualTo(asGraph.edges());
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Tue Feb 06 18:35:19 GMT 2024 - 20K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/StandardValueGraph.java
* limitations under the License. */ package com.google.common.graph; import static com.google.common.base.Preconditions.checkNotNull; import static com.google.common.graph.GraphConstants.DEFAULT_NODE_COUNT; import static com.google.common.graph.Graphs.checkNonNegative; import java.util.Iterator; import java.util.Map; import java.util.Set; import java.util.TreeMap;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 6.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/ValueGraphTest.java
MutableValueGraph<Integer, String> graph; @After public void validateGraphState() { assertStronglyEquivalent(graph, Graphs.copyOf(graph)); assertStronglyEquivalent(graph, ImmutableValueGraph.copyOf(graph)); Graph<Integer> asGraph = graph.asGraph(); AbstractGraphTest.validateGraph(asGraph); assertThat(graph.nodes()).isEqualTo(asGraph.nodes()); assertThat(graph.edges()).isEqualTo(asGraph.edges());
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 17.4K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/ElementOrderTest.java
assertThat(graph.nodeOrder().comparator()).isEqualTo(Ordering.natural()); assertThat(graph.nodes()).containsExactly(node2, node4, node6, node8).inOrder(); } private static void addNodes(MutableGraph<Integer> graph) { graph.addNode(3); graph.addNode(1); graph.addNode(4); } private static void addEdges(MutableNetwork<Integer, String> network) { network.addEdge(3, 1, "i");
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 8.1K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/AbstractGraphTest.java
assertThat(graph.predecessors(node)).hasSize(graph.inDegree(node)); assertThat(graph.successors(node)).hasSize(graph.outDegree(node)); } else { int selfLoopCount = graph.adjacentNodes(node).contains(node) ? 1 : 0; assertThat(graph.degree(node)).isEqualTo(graph.adjacentNodes(node).size() + selfLoopCount);
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 16.6K bytes - Viewed (0)