- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 29 for MutableGraph (0.17 sec)
-
guava-tests/test/com/google/common/graph/ElementOrderTest.java
public final class ElementOrderTest { // Node order tests @Test public void nodeOrder_none() { MutableGraph<Integer> graph = GraphBuilder.directed().nodeOrder(unordered()).build(); assertThat(graph.nodeOrder()).isEqualTo(unordered()); } @Test public void nodeOrder_insertion() { MutableGraph<Integer> graph = GraphBuilder.directed().nodeOrder(insertion()).build(); addNodes(graph);
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/ImmutableGraph.java
* * @since 28.0 */ public static class Builder<N> { private final MutableGraph<N> mutableGraph; Builder(GraphBuilder<N> graphBuilder) { // The incidentEdgeOrder for immutable graphs is always stable. However, we don't want to // modify this builder, so we make a copy instead. this.mutableGraph = graphBuilder.copy().incidentEdgeOrder(ElementOrder.<N>stable()).build(); } /**
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Feb 01 16:30:37 GMT 2022 - 7.1K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/EndpointPairTest.java
} // Tests for Graph.edges() and Network.asGraph().edges() methods // TODO(user): Move these to a more appropriate location in the test suite. @Test public void endpointPair_directedGraph() { MutableGraph<Integer> directedGraph = GraphBuilder.directed().allowsSelfLoops(true).build(); directedGraph.addNode(N0); directedGraph.putEdge(N1, N2); directedGraph.putEdge(N2, N1); directedGraph.putEdge(N1, N3);
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 9.4K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/EndpointPairTest.java
} // Tests for Graph.edges() and Network.asGraph().edges() methods // TODO(user): Move these to a more appropriate location in the test suite. @Test public void endpointPair_directedGraph() { MutableGraph<Integer> directedGraph = GraphBuilder.directed().allowsSelfLoops(true).build(); directedGraph.addNode(N0); directedGraph.putEdge(N1, N2); directedGraph.putEdge(N2, N1); directedGraph.putEdge(N1, N3);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 9.4K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/GraphMutationTest.java
Random gen = new Random(42); // Fixed seed so test results are deterministic. for (int trial = 0; trial < NUM_TRIALS; ++trial) { MutableGraph<Integer> graph = graphBuilder.allowsSelfLoops(true).build(); assertThat(graph.nodes()).isEmpty(); assertThat(graph.edges()).isEmpty(); AbstractGraphTest.validateGraph(graph);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Fri Aug 18 16:17:46 GMT 2017 - 4.2K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractGraphTest.java
final boolean graphIsMutable() { return graphAsMutableGraph != null; } @Before public final void init() { graph = createGraph(); if (graph instanceof MutableGraph) { graphAsMutableGraph = (MutableGraph<Integer>) graph; } } @After public final void validateGraphState() { validateGraph(graph); } static <N> void validateGraph(Graph<N> graph) {
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) -
guava-tests/test/com/google/common/graph/StandardMutableDirectedGraphTest.java
boolean allowsSelfLoops, ElementOrder<Integer> incidentEdgeOrder) { this.allowsSelfLoops = allowsSelfLoops; this.incidentEdgeOrder = incidentEdgeOrder; } @Override public MutableGraph<Integer> createGraph() { return GraphBuilder.directed() .allowsSelfLoops(allowsSelfLoops) .incidentEdgeOrder(incidentEdgeOrder) .build(); } @Override
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Tue Mar 10 17:54:18 GMT 2020 - 2K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/StandardMutableUndirectedGraphTest.java
boolean allowsSelfLoops, ElementOrder<Integer> incidentEdgeOrder) { this.allowsSelfLoops = allowsSelfLoops; this.incidentEdgeOrder = incidentEdgeOrder; } @Override public MutableGraph<Integer> createGraph() { return GraphBuilder.undirected() .allowsSelfLoops(allowsSelfLoops) .incidentEdgeOrder(incidentEdgeOrder) .build(); } @Override
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Mar 10 17:54:18 GMT 2020 - 2K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graph.java
* create an instance of one of the built-in implementations of {@code Graph}, use the {@link * GraphBuilder} class: * * <pre>{@code * MutableGraph<Integer> graph = GraphBuilder.undirected().build(); * }</pre> * * <p>{@link GraphBuilder#build()} returns an instance of {@link MutableGraph}, which is a subtype * of {@code Graph} that provides methods for adding and removing nodes and edges. If you do not
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-tests/test/com/google/common/graph/GraphPropertiesTest.java
@RunWith(JUnit4.class) public class GraphPropertiesTest { ImmutableList<MutableGraph<Integer>> graphsToTest; Graph<Integer> directedGraph; Graph<Integer> undirectedGraph; ImmutableList<MutableNetwork<Integer, String>> networksToTest; Network<Integer, String> directedNetwork; Network<Integer, String> undirectedNetwork; @Before public void init() { MutableGraph<Integer> mutableDirectedGraph =
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Jun 19 21:11:54 GMT 2017 - 5.7K bytes - Viewed (0)