- Sort Score
- Result 10 results
- Languages All
Results 1 - 6 of 6 for isDirected (0.03 sec)
-
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: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Fri Aug 01 00:26:14 UTC 2025 - 22.7K 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: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Fri Aug 01 00:26:14 UTC 2025 - 23.3K bytes - Viewed (0) -
guava/src/com/google/common/graph/EndpointPair.java
static <N> EndpointPair<N> of(Graph<?> graph, N nodeU, N nodeV) { return graph.isDirected() ? ordered(nodeU, nodeV) : unordered(nodeU, nodeV); } /** Returns an {@link EndpointPair} representing the endpoints of an edge in {@code network}. */ static <N> EndpointPair<N> of(Network<?, ?> network, N nodeU, N nodeV) { return network.isDirected() ? ordered(nodeU, nodeV) : unordered(nodeU, nodeV); } /**
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Tue Jul 08 18:32:10 UTC 2025 - 8.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/EndpointPair.java
static <N> EndpointPair<N> of(Graph<?> graph, N nodeU, N nodeV) { return graph.isDirected() ? ordered(nodeU, nodeV) : unordered(nodeU, nodeV); } /** Returns an {@link EndpointPair} representing the endpoints of an edge in {@code network}. */ static <N> EndpointPair<N> of(Network<?, ?> network, N nodeU, N nodeV) { return network.isDirected() ? ordered(nodeU, nodeV) : unordered(nodeU, nodeV); } /**
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Tue Jul 08 18:32:10 UTC 2025 - 8.1K 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: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Aug 11 22:03:02 UTC 2025 - 22.5K bytes - Viewed (0) -
okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/http/HttpStatusCodes.kt
/** `307 Temporary Redirect` (HTTP/1.1 - RFC 7231) */ const val HTTP_TEMP_REDIRECT = 307 /** `308 Permanent Redirect` (HTTP/1.1 - RFC 7538) */ const val HTTP_PERM_REDIRECT = 308 /** `421 Misdirected Request` (HTTP/2 - RFC 7540) */
Registered: Fri Sep 05 11:42:10 UTC 2025 - Last Modified: Mon Jul 28 14:39:28 UTC 2025 - 2K bytes - Viewed (0)