- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 13 for isRedirected (0.45 sec)
-
android/guava/src/com/google/common/graph/AbstractNetwork.java
return endpoints.isOrdered() == this.isDirected(); } @Override public final boolean equals(@CheckForNull Object obj) { if (obj == this) { return true; } if (!(obj instanceof Network)) { return false; } Network<?, ?> other = (Network<?, ?>) obj; return isDirected() == other.isDirected() && nodes().equals(other.nodes())
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Mar 13 18:17:09 UTC 2024 - 10.1K bytes - Viewed (0) -
guava/src/com/google/common/graph/AbstractNetwork.java
return endpoints.isOrdered() == this.isDirected(); } @Override public final boolean equals(@CheckForNull Object obj) { if (obj == this) { return true; } if (!(obj instanceof Network)) { return false; } Network<?, ?> other = (Network<?, ?>) obj; return isDirected() == other.isDirected() && nodes().equals(other.nodes())
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Mar 13 18:17:09 UTC 2024 - 10.4K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graphs.java
*/ public static <N> boolean hasCycle(Graph<N> graph) { int numEdges = graph.edges().size(); if (numEdges == 0) { return false; // An edge-free graph is acyclic by definition. } if (!graph.isDirected() && numEdges >= graph.nodes().size()) { return true; // Optimization for the undirected case: at least one cycle must exist. } Map<Object, NodeVisitState> visitedNodes =
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 21.2K bytes - Viewed (0) -
guava/src/com/google/common/graph/Graphs.java
*/ public static <N> boolean hasCycle(Graph<N> graph) { int numEdges = graph.edges().size(); if (numEdges == 0) { return false; // An edge-free graph is acyclic by definition. } if (!graph.isDirected() && numEdges >= graph.nodes().size()) { return true; // Optimization for the undirected case: at least one cycle must exist. } Map<Object, NodeVisitState> visitedNodes =
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 21.7K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/AbstractGraphTest.java
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()); int nodeStart = graphString.indexOf("nodes:"); int edgeStart = graphString.indexOf("edges:");
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 16.6K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graph.java
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
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 13.6K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ValueGraph.java
* * <ul> * <li>A and B have equal {@link #isDirected() directedness}. * <li>A and B have equal {@link #nodes() node sets}. * <li>A and B have equal {@link #edges() edge sets}. * <li>The {@link #edgeValueOrDefault(N, N, V) value} of a given edge is the same in both A and * B. * </ul> * * <p>Graph properties besides {@link #isDirected() directedness} do <b>not</b> affect equality.
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 15K bytes - Viewed (0) -
guava/src/com/google/common/graph/ValueGraph.java
* * <ul> * <li>A and B have equal {@link #isDirected() directedness}. * <li>A and B have equal {@link #nodes() node sets}. * <li>A and B have equal {@link #edges() edge sets}. * <li>The {@link #edgeValue(N, N) value} of a given edge is the same in both A and B. * </ul> * * <p>Graph properties besides {@link #isDirected() directedness} do <b>not</b> affect equality.
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 16K bytes - Viewed (0) -
guava/src/com/google/common/graph/Network.java
* * <ul> * <li>A and B have equal {@link #isDirected() directedness}. * <li>A and B have equal {@link #nodes() node sets}. * <li>A and B have equal {@link #edges() edge sets}. * <li>Every edge in A and B connects the same nodes in the same direction (if any). * </ul> * * <p>Network properties besides {@link #isDirected() directedness} do <b>not</b> affect equality.
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 22.3K bytes - Viewed (0)