/** Returns an immutable copy of {@code graph}. */ public static <N> ImmutableGraph<N> copyOf(Graph<N> graph) { return (graph instanceof ImmutableGraph) ? (ImmutableGraph<N>) graph : new ImmutableGraph<N>( new ConfigurableValueGraph<N, Presence>( GraphBuilder.from(graph), getNodeConnections(graph), graph.edges().size())); }
@Override public Set<N> adjacentNodes(N node) { return checkedConnections(node).adjacentNodes(); }
@Override public @Nullable V edgeValueOrDefault(EndpointPair<N> endpoints, @Nullable V defaultValue) { validateEndpoints(endpoints); return edgeValueOrDefault_internal(endpoints.nodeU(), endpoints.nodeV(), defaultValue); }
@Override public boolean hasEdgeConnecting(EndpointPair<N> endpoints) { checkNotNull(endpoints); return isOrderingCompatible(endpoints) && hasEdgeConnecting_internal(endpoints.nodeU(), endpoints.nodeV()); }
@Override public boolean hasEdgeConnecting(N nodeU, N nodeV) { return hasEdgeConnecting_internal(checkNotNull(nodeU), checkNotNull(nodeV)); }
@Override public @Nullable V edgeValueOrDefault(N nodeU, N nodeV, @Nullable V defaultValue) { return edgeValueOrDefault_internal(checkNotNull(nodeU), checkNotNull(nodeV), defaultValue); }
@Override public Set<N> predecessors(N node) { return checkedConnections(node).predecessors(); }
/** Returns an immutable copy of {@code graph}. */ public static <N> ImmutableGraph<N> copyOf(Graph<N> graph) { return (graph instanceof ImmutableGraph) ? (ImmutableGraph<N>) graph : new ImmutableGraph<N>( new ConfigurableValueGraph<N, Presence>( GraphBuilder.from(graph), getNodeConnections(graph), graph.edges().size())); }
@Override public Set<N> successors(N node) { return checkedConnections(node).successors(); }
/** Returns an immutable copy of {@code graph}. */ public static <N> ImmutableGraph<N> copyOf(Graph<N> graph) { return (graph instanceof ImmutableGraph) ? (ImmutableGraph<N>) graph : new ImmutableGraph<N>( new ConfigurableValueGraph<N, Presence>( GraphBuilder.from(graph), getNodeConnections(graph), graph.edges().size())); }
@Override public Set<N> predecessors(N node) { return checkedConnections(node).predecessors(); }
/** Returns an immutable copy of {@code graph}. */ public static <N> ImmutableGraph<N> copyOf(Graph<N> graph) { return (graph instanceof ImmutableGraph) ? (ImmutableGraph<N>) graph : new ImmutableGraph<N>( new ConfigurableValueGraph<N, Presence>( GraphBuilder.from(graph), getNodeConnections(graph), graph.edges().size())); }
@Override public Set<N> adjacentNodes(N node) { return checkedConnections(node).adjacentNodes(); }
/** Returns an immutable copy of {@code graph}. */ public static <N> ImmutableGraph<N> copyOf(Graph<N> graph) { return (graph instanceof ImmutableGraph) ? (ImmutableGraph<N>) graph : new ImmutableGraph<N>( new ConfigurableValueGraph<N, Presence>( GraphBuilder.from(graph), getNodeConnections(graph), graph.edges().size())); }
@Override public Set<N> successors(N node) { return checkedConnections(node).successors(); }
@Override public Set<N> adjacentNodes(N node) { return checkedConnections(node).adjacentNodes(); }
@Override public Set<N> predecessors(N node) { return checkedConnections(node).predecessors(); }
@Override public Set<N> successors(N node) { return checkedConnections(node).successors(); }
@Override public Set<N> adjacentNodes(N node) { return checkedConnections(node).adjacentNodes(); }
@Override public Set<N> adjacentNodes(N node) { return checkedConnections(node).adjacentNodes(); }