- Sort Score
- Result 10 results
- Languages All
Results 31 - 38 of 38 for nodeOrder (0.15 sec)
-
android/guava/src/com/google/common/graph/AbstractValueGraph.java
} @Override public boolean allowsSelfLoops() { return AbstractValueGraph.this.allowsSelfLoops(); } @Override public ElementOrder<N> nodeOrder() { return AbstractValueGraph.this.nodeOrder(); } @Override public ElementOrder<N> incidentEdgeOrder() { return AbstractValueGraph.this.incidentEdgeOrder(); } @Override
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 17 13:59:28 GMT 2023 - 4K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graph.java
@ElementTypesAreNonnullByDefault public interface Graph<N> extends BaseGraph<N> { // // Graph-level accessors // /** Returns all nodes in this graph, in the order specified by {@link #nodeOrder()}. */ @Override Set<N> nodes(); /** Returns all edges in this graph. */ @Override Set<EndpointPair<N>> edges(); // // Graph properties // /**
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/AbstractGraphBuilder.java
* * @author James Sexton */ @ElementTypesAreNonnullByDefault abstract class AbstractGraphBuilder<N> { final boolean directed; boolean allowsSelfLoops = false; ElementOrder<N> nodeOrder = ElementOrder.insertion(); ElementOrder<N> incidentEdgeOrder = ElementOrder.unordered(); Optional<Integer> expectedNodeCount = Optional.absent(); /**
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 1.4K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Network.java
public interface Network<N, E> extends SuccessorsFunction<N>, PredecessorsFunction<N> { // // Network-level accessors // /** Returns all nodes in this network, in the order specified by {@link #nodeOrder()}. */ Set<N> nodes(); /** Returns all edges in this network, in the order specified by {@link #edgeOrder()}. */ Set<E> edges(); /**
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 21.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/AbstractNetwork.java
&& successors((N) endpointPair.nodeU()).contains(endpointPair.nodeV()); } }; } @Override public ElementOrder<N> nodeOrder() { return AbstractNetwork.this.nodeOrder(); } @Override public ElementOrder<N> incidentEdgeOrder() { // TODO(b/142723300): Return AbstractNetwork.this.incidentEdgeOrder() once Network has that
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Mar 13 18:17:09 GMT 2024 - 10.1K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/AbstractNetworkTest.java
AbstractGraphTest.validateGraph(asGraph); assertThat(network.nodes()).isEqualTo(asGraph.nodes()); assertThat(network.edges().size()).isAtLeast(asGraph.edges().size()); assertThat(network.nodeOrder()).isEqualTo(asGraph.nodeOrder()); assertThat(network.isDirected()).isEqualTo(asGraph.isDirected()); assertThat(network.allowsSelfLoops()).isEqualTo(asGraph.allowsSelfLoops()); for (E edge : sanityCheckSet(network.edges())) {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 33K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractNetworkTest.java
AbstractGraphTest.validateGraph(asGraph); assertThat(network.nodes()).isEqualTo(asGraph.nodes()); assertThat(network.edges().size()).isAtLeast(asGraph.edges().size()); assertThat(network.nodeOrder()).isEqualTo(asGraph.nodeOrder()); assertThat(network.isDirected()).isEqualTo(asGraph.isDirected()); assertThat(network.allowsSelfLoops()).isEqualTo(asGraph.allowsSelfLoops()); for (E edge : sanityCheckSet(network.edges())) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 32.7K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/ValueGraphTest.java
AbstractGraphTest.validateGraph(asGraph); assertThat(graph.nodes()).isEqualTo(asGraph.nodes()); assertThat(graph.edges()).isEqualTo(asGraph.edges()); assertThat(graph.nodeOrder()).isEqualTo(asGraph.nodeOrder()); assertThat(graph.incidentEdgeOrder()).isEqualTo(asGraph.incidentEdgeOrder()); assertThat(graph.isDirected()).isEqualTo(asGraph.isDirected());
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)