Uses of Class
com.google.common.graph.EndpointPair
Packages that use EndpointPair
-
Uses of EndpointPair in com.google.common.graph
Subclasses of EndpointPair in com.google.common.graphModifier and TypeClassDescriptionprivate static final classprivate static final classMethods in com.google.common.graph that return EndpointPairModifier and TypeMethodDescriptionprotected EndpointPair<N>EndpointPairIterator.Directed.computeNext()protected EndpointPair<N>EndpointPairIterator.Undirected.computeNext()ForwardingNetwork.incidentNodes(E edge) Graphs.TransposedNetwork.incidentNodes(E edge) Network.incidentNodes(E edge) Returns the nodes which are the endpoints ofedgein this network.StandardNetwork.incidentNodes(E edge) (package private) static <N> EndpointPair<N>Returns anEndpointPairrepresenting the endpoints of an edge ingraph.(package private) static <N> EndpointPair<N>Returns anEndpointPairrepresenting the endpoints of an edge innetwork.static <N> EndpointPair<N>EndpointPair.ordered(N source, N target) Returns anEndpointPairrepresenting the endpoints of a directed edge.(package private) static <N> EndpointPair<N>Graphs.transpose(EndpointPair<N> endpoints) static <N> EndpointPair<N>EndpointPair.unordered(N nodeU, N nodeV) Returns anEndpointPairrepresenting the endpoints of an undirected edge.Methods in com.google.common.graph that return types with arguments of type EndpointPairModifier and TypeMethodDescriptionprivate static <N,E> Map<E, EndpointPair<N>> AbstractNetwork.edgeIncidentNodesMap(Network<N, E> network) Set<EndpointPair<N>>AbstractBaseGraph.edges()An implementation ofBaseGraph.edges()defined in terms ofGraph.nodes()andBaseGraph.successors(Object).Set<EndpointPair<N>>BaseGraph.edges()Returns all edges in this graph.Set<EndpointPair<N>>Graph.edges()Returns all edges in this graph.Set<EndpointPair<N>>ValueGraph.edges()Returns all edges in this graph.private static <N,V> Map<EndpointPair<N>, V> AbstractValueGraph.edgeValueMap(ValueGraph<N, V> graph) DirectedGraphConnections.incidentEdgeIterator(N thisNode) GraphConnections.incidentEdgeIterator(N thisNode) Returns an iterator over the incident edges.UndirectedGraphConnections.incidentEdgeIterator(N thisNode) Set<EndpointPair<N>>AbstractBaseGraph.incidentEdges(N node) Set<EndpointPair<N>>BaseGraph.incidentEdges(N node) Returns the edges in this graph whose endpoints includenode.Set<EndpointPair<N>>ForwardingGraph.incidentEdges(N node) Set<EndpointPair<N>>Graph.incidentEdges(N node) Returns the edges in this graph whose endpoints includenode.Set<EndpointPair<N>>Graphs.TransposedGraph.incidentEdges(N node) Set<EndpointPair<N>>StandardValueGraph.incidentEdges(N node) Set<EndpointPair<N>>ValueGraph.incidentEdges(N node) Returns the edges in this graph whose endpoints includenode.Methods in com.google.common.graph with parameters of type EndpointPairModifier and TypeMethodDescriptionImmutableNetwork.Builder.addEdge(EndpointPair<N> endpoints, E edge) Addsedgeconnectingendpoints.booleanMutableNetwork.addEdge(EndpointPair<N> endpoints, E edge) Addsedgeconnectingendpoints.booleanStandardMutableNetwork.addEdge(EndpointPair<N> endpoints, E edge) AbstractNetwork.edgeConnecting(EndpointPair<N> endpoints) ForwardingNetwork.edgeConnecting(EndpointPair<N> endpoints) Graphs.TransposedNetwork.edgeConnecting(EndpointPair<N> endpoints) Network.edgeConnecting(EndpointPair<N> endpoints) Returns the single edge that directly connectsendpoints(in the order, if any, specified byendpoints), if one is present, orOptional.empty()if no such edge exists.AbstractNetwork.edgeConnectingOrNull(EndpointPair<N> endpoints) ForwardingNetwork.edgeConnectingOrNull(EndpointPair<N> endpoints) Graphs.TransposedNetwork.edgeConnectingOrNull(EndpointPair<N> endpoints) Network.edgeConnectingOrNull(EndpointPair<N> endpoints) Returns the single edge that directly connectsendpoints(in the order, if any, specified byendpoints), if one is present, ornullif no such edge exists.AbstractNetwork.edgesConnecting(EndpointPair<N> endpoints) ForwardingNetwork.edgesConnecting(EndpointPair<N> endpoints) Graphs.TransposedNetwork.edgesConnecting(EndpointPair<N> endpoints) Network.edgesConnecting(EndpointPair<N> endpoints) Returns the set of edges that each directly connectendpoints(in the order, if any, specified byendpoints).AbstractValueGraph.edgeValue(EndpointPair<N> endpoints) ForwardingValueGraph.edgeValue(EndpointPair<N> endpoints) Graphs.TransposedValueGraph.edgeValue(EndpointPair<N> endpoints) ValueGraph.edgeValue(EndpointPair<N> endpoints) Returns the value of the edge that connectsendpoints(in the order, if any, specified byendpoints), if one is present; otherwise, returnsOptional.empty().ForwardingValueGraph.edgeValueOrDefault(EndpointPair<N> endpoints, V defaultValue) Graphs.TransposedValueGraph.edgeValueOrDefault(EndpointPair<N> endpoints, V defaultValue) StandardValueGraph.edgeValueOrDefault(EndpointPair<N> endpoints, V defaultValue) ValueGraph.edgeValueOrDefault(EndpointPair<N> endpoints, V defaultValue) Returns the value of the edge that connectsendpoints(in the order, if any, specified byendpoints), if one is present; otherwise, returnsdefaultValue.booleanAbstractBaseGraph.hasEdgeConnecting(EndpointPair<N> endpoints) booleanAbstractNetwork.hasEdgeConnecting(EndpointPair<N> endpoints) booleanBaseGraph.hasEdgeConnecting(EndpointPair<N> endpoints) Returns true if there is an edge that directly connectsendpoints(in the order, if any, specified byendpoints).booleanForwardingGraph.hasEdgeConnecting(EndpointPair<N> endpoints) booleanForwardingNetwork.hasEdgeConnecting(EndpointPair<N> endpoints) booleanForwardingValueGraph.hasEdgeConnecting(EndpointPair<N> endpoints) booleanGraph.hasEdgeConnecting(EndpointPair<N> endpoints) Returns true if there is an edge that directly connectsendpoints(in the order, if any, specified byendpoints).booleanGraphs.TransposedGraph.hasEdgeConnecting(EndpointPair<N> endpoints) booleanGraphs.TransposedNetwork.hasEdgeConnecting(EndpointPair<N> endpoints) booleanGraphs.TransposedValueGraph.hasEdgeConnecting(EndpointPair<N> endpoints) booleanNetwork.hasEdgeConnecting(EndpointPair<N> endpoints) Returns true if there is an edge that directly connectsendpoints(in the order, if any, specified byendpoints).booleanStandardValueGraph.hasEdgeConnecting(EndpointPair<N> endpoints) booleanValueGraph.hasEdgeConnecting(EndpointPair<N> endpoints) Returns true if there is an edge that directly connectsendpoints(in the order, if any, specified byendpoints).protected final booleanAbstractBaseGraph.isOrderingCompatible(EndpointPair<?> endpoints) Returnstrueiffendpoints' ordering is compatible with the directionality of this graph.protected final booleanAbstractNetwork.isOrderingCompatible(EndpointPair<?> endpoints) ImmutableGraph.Builder.putEdge(EndpointPair<N> endpoints) Adds an edge connectingendpoints(in the order, if any, specified byendpoints) if one is not already present.booleanMutableGraph.putEdge(EndpointPair<N> endpoints) Adds an edge connectingendpoints(in the order, if any, specified byendpoints) if one is not already present.booleanStandardMutableGraph.putEdge(EndpointPair<N> endpoints) ImmutableValueGraph.Builder.putEdgeValue(EndpointPair<N> endpoints, V value) Adds an edge connectingendpointsif one is not already present, and sets a value for that edge tovalue(overwriting the existing value, if any).MutableValueGraph.putEdgeValue(EndpointPair<N> endpoints, V value) Adds an edge connectingendpointsif one is not already present, and sets a value for that edge tovalue(overwriting the existing value, if any).StandardMutableValueGraph.putEdgeValue(EndpointPair<N> endpoints, V value) booleanMutableGraph.removeEdge(EndpointPair<N> endpoints) Removes the edge connectingendpoints, if it is present.MutableValueGraph.removeEdge(EndpointPair<N> endpoints) Removes the edge connectingendpoints, if it is present.booleanStandardMutableGraph.removeEdge(EndpointPair<N> endpoints) StandardMutableValueGraph.removeEdge(EndpointPair<N> endpoints) (package private) static <N> EndpointPair<N>Graphs.transpose(EndpointPair<N> endpoints) protected final voidAbstractBaseGraph.validateEndpoints(EndpointPair<?> endpoints) ThrowsIllegalArgumentExceptionif the ordering ofendpointsis not compatible with the directionality of this graph.protected final voidAbstractNetwork.validateEndpoints(EndpointPair<?> endpoints) Throws an IllegalArgumentException if the ordering ofendpointsis not compatible with the directionality of this graph.Method parameters in com.google.common.graph with type arguments of type EndpointPairModifier and TypeMethodDescription(package private) static <N,V> DirectedGraphConnections<N, V> DirectedGraphConnections.ofImmutable(N thisNode, Iterable<EndpointPair<N>> incidentEdges, Function<N, V> successorNodeToValueFn)