- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 40 for isRedirected (0.18 sec)
-
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) -
android/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 - 21.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ImmutableGraph.java
private static <N> GraphConnections<N, Presence> connectionsOf(Graph<N> graph, N node) { Function<N, Presence> edgeValueFn = (Function<N, Presence>) Functions.constant(Presence.EDGE_EXISTS); return graph.isDirected() ? DirectedGraphConnections.ofImmutable(node, graph.incidentEdges(node), edgeValueFn) : UndirectedGraphConnections.ofImmutable( Maps.asMap(graph.adjacentNodes(node), edgeValueFn)); }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Feb 01 16:30:37 UTC 2022 - 7.1K bytes - Viewed (0) -
guava/src/com/google/common/graph/ImmutableGraph.java
private static <N> GraphConnections<N, Presence> connectionsOf(Graph<N> graph, N node) { Function<N, Presence> edgeValueFn = (Function<N, Presence>) Functions.constant(Presence.EDGE_EXISTS); return graph.isDirected() ? DirectedGraphConnections.ofImmutable(node, graph.incidentEdges(node), edgeValueFn) : UndirectedGraphConnections.ofImmutable( Maps.asMap(graph.adjacentNodes(node), edgeValueFn)); }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Feb 01 16:30:37 UTC 2022 - 7.1K bytes - Viewed (0) -
guava/src/com/google/common/graph/ImmutableValueGraph.java
(N successorNode) -> // requireNonNull is safe because the endpoint pair comes from the graph. requireNonNull(graph.edgeValueOrDefault(node, successorNode, null)); return graph.isDirected() ? DirectedGraphConnections.ofImmutable( node, graph.incidentEdges(node), successorNodeToValueFn) : UndirectedGraphConnections.ofImmutable(
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Feb 01 16:30:37 UTC 2022 - 7.7K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ImmutableValueGraph.java
(N successorNode) -> // requireNonNull is safe because the endpoint pair comes from the graph. requireNonNull(graph.edgeValueOrDefault(node, successorNode, null)); return graph.isDirected() ? DirectedGraphConnections.ofImmutable( node, graph.incidentEdges(node), successorNodeToValueFn) : UndirectedGraphConnections.ofImmutable(
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Feb 01 16:30:37 UTC 2022 - 7.7K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Traverser.java
public static <N> Traverser<N> forTree(SuccessorsFunction<N> tree) { if (tree instanceof BaseGraph) { checkArgument(((BaseGraph<?>) tree).isDirected(), "Undirected graphs can never be trees."); } if (tree instanceof Network) { checkArgument(((Network<?, ?>) tree).isDirected(), "Undirected networks can never be trees."); } return new Traverser<N>(tree) { @Override Traversal<N> newTraversal() {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue May 30 20:12:45 UTC 2023 - 19.8K bytes - Viewed (0) -
guava/src/com/google/common/graph/Traverser.java
public static <N> Traverser<N> forTree(SuccessorsFunction<N> tree) { if (tree instanceof BaseGraph) { checkArgument(((BaseGraph<?>) tree).isDirected(), "Undirected graphs can never be trees."); } if (tree instanceof Network) { checkArgument(((Network<?, ?>) tree).isDirected(), "Undirected networks can never be trees."); } return new Traverser<N>(tree) { @Override Traversal<N> newTraversal() {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue May 30 20:12:45 UTC 2023 - 19.8K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/BaseGraph.java
* EndpointPair#source() source node} to a {@link EndpointPair#target() target node}, while * undirected edges connect a pair of nodes to each other. */ boolean isDirected(); /** * Returns true if this graph allows self-loops (edges that connect a node to itself). Attempting * to add a self-loop to a graph that does not allow them will throw an {@link * IllegalArgumentException}.
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 8.8K bytes - Viewed (0) -
guava/src/com/google/common/graph/BaseGraph.java
* EndpointPair#source() source node} to a {@link EndpointPair#target() target node}, while * undirected edges connect a pair of nodes to each other. */ boolean isDirected(); /** * Returns true if this graph allows self-loops (edges that connect a node to itself). Attempting * to add a self-loop to a graph that does not allow them will throw an {@link * IllegalArgumentException}.
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 8.8K bytes - Viewed (0)