- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 12 for ImmutableGraph (0.3 sec)
-
android/guava/src/com/google/common/graph/GraphBuilder.java
* graph.putEdge("bread", "bread"); * graph.putEdge("chocolate", "peanut butter"); * graph.putEdge("peanut butter", "jelly"); * * // Building an immutable graph * ImmutableGraph<String> immutableGraph = * GraphBuilder.undirected() * .allowsSelfLoops(true) * .<String>immutable() * .putEdge("bread", "bread") * .putEdge("chocolate", "peanut butter")
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Jun 03 01:21:31 GMT 2022 - 7.3K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/PackageSanityTests.java
ValueGraphBuilder.directed().allowsSelfLoops(true).expectedNodeCount(16); private static final ImmutableGraph<String> IMMUTABLE_GRAPH_A = GraphBuilder.directed().<String>immutable().addNode("A").build(); private static final ImmutableGraph<String> IMMUTABLE_GRAPH_B = GraphBuilder.directed().<String>immutable().addNode("B").build();
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Nov 09 19:24:25 GMT 2023 - 3.2K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/PackageSanityTests.java
ValueGraphBuilder.directed().allowsSelfLoops(true).expectedNodeCount(16); private static final ImmutableGraph<String> IMMUTABLE_GRAPH_A = GraphBuilder.directed().<String>immutable().addNode("A").build(); private static final ImmutableGraph<String> IMMUTABLE_GRAPH_B = GraphBuilder.directed().<String>immutable().addNode("B").build();
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Nov 09 19:24:25 GMT 2023 - 3.2K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graph.java
* you should use the non-mutating {@link Graph} interface, or an {@link ImmutableGraph}. * * <p>You can create an immutable copy of an existing {@code Graph} using {@link * ImmutableGraph#copyOf(Graph)}: * * <pre>{@code * ImmutableGraph<Integer> immutableGraph = ImmutableGraph.copyOf(graph); * }</pre> * * <p>Instances of {@link ImmutableGraph} do not implement {@link MutableGraph} (obviously!) and are
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 13.6K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graphs.java
* * @since 33.1.0 (present with return type {@code Graph} since 20.0) */ // TODO(b/31438252): Consider potential optimizations for this algorithm. public static <N> ImmutableGraph<N> transitiveClosure(Graph<N> graph) { ImmutableGraph.Builder<N> transitiveClosure = GraphBuilder.from(graph).allowsSelfLoops(true).<N>immutable(); // Every node is, at a minimum, reachable from itself. Since the resulting transitive closure
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 21.2K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ValueGraphBuilder.java
* graph.putEdgeValue("San Jose", "San Jose", 0.0); * graph.putEdgeValue("San Francisco", "San Jose", 48.4); * * // Building an immutable value graph * ImmutableValueGraph<String, Double> immutableGraph = * ValueGraphBuilder.undirected() * .allowsSelfLoops(true) * .<String, Double>immutable() * .putEdgeValue("San Francisco", "San Francisco", 0.0)
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Jun 03 01:21:31 GMT 2022 - 8K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/AbstractGraphTest.java
validateGraph(graph); } static <N> void validateGraph(Graph<N> graph) { assertStronglyEquivalent(graph, Graphs.copyOf(graph)); assertStronglyEquivalent(graph, ImmutableGraph.copyOf(graph)); String graphString = graph.toString(); assertThat(graphString).contains("isDirected: " + graph.isDirected()); assertThat(graphString).contains("allowsSelfLoops: " + graph.allowsSelfLoops());
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) -
android/guava-tests/test/com/google/common/graph/AbstractGraphTest.java
validateGraph(graph); } static <N> void validateGraph(Graph<N> graph) { assertStronglyEquivalent(graph, Graphs.copyOf(graph)); assertStronglyEquivalent(graph, ImmutableGraph.copyOf(graph)); String graphString = graph.toString(); assertThat(graphString).contains("isDirected: " + graph.isDirected()); assertThat(graphString).contains("allowsSelfLoops: " + graph.allowsSelfLoops());
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 16.6K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ValueGraph.java
* ImmutableValueGraph}. * * <p>You can create an immutable copy of an existing {@code ValueGraph} using {@link * ImmutableValueGraph#copyOf(ValueGraph)}: * * <pre>{@code * ImmutableValueGraph<Integer, Double> immutableGraph = ImmutableValueGraph.copyOf(graph); * }</pre> * * <p>Instances of {@link ImmutableValueGraph} do not implement {@link MutableValueGraph} * (obviously!) and are contractually guaranteed to be unmodifiable and thread-safe.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 15K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/TraverserTest.java
return Ordering.natural().immutableSortedCopy(graphMap.get(node)); } }; } private static ImmutableGraph<Character> createSingleRootGraph() { MutableGraph<Character> graph = GraphBuilder.directed().build(); graph.addNode('a'); return ImmutableGraph.copyOf(graph); } private static void assertEqualCharNodes(Iterable<Character> result, String expectedCharacters) {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 47.5K bytes - Viewed (0)