Class EndpointPair<N>
java.lang.Object
com.google.common.graph.EndpointPair<N>
- All Implemented Interfaces:
Iterable<N>
@Beta
@Immutable(containerOf="N")
public abstract class EndpointPair<N>
extends Object
implements Iterable<N>
An immutable pair representing the two endpoints of an edge in a graph. The
EndpointPair
of a directed edge is an ordered pair of nodes (source() and target()). The
EndpointPair of an undirected edge is an unordered pair of nodes (nodeU() and
nodeV()).
The edge is a self-loop if, and only if, the two endpoints are equal.
- Since:
- 20.0
- Author:
- James Sexton
-
Method Summary
Modifier and TypeMethodDescriptionfinal NadjacentNode(N node) Returns the node that is adjacent tonodealong the origin edge.abstract booleanabstract inthashCode()The hashcode of an orderedEndpointPairis equal toObjects.hash(source(), target()).abstract booleanReturnstrueif thisEndpointPairis an ordered pair (i.e. represents the endpoints of a directed edge).final UnmodifiableIterator<N> iterator()final NnodeU()If thisEndpointPairisOrdered()returns thesource(); otherwise, returns an arbitrary (but consistent) endpoint of the origin edge.final NnodeV()static <N> EndpointPair<N> ordered(N source, N target) Returns anEndpointPairrepresenting the endpoints of a directed edge.abstract Nsource()If thisEndpointPairisOrdered(), returns the node which is the source.abstract Ntarget()If thisEndpointPairisOrdered(), returns the node which is the target.static <N> EndpointPair<N> unordered(N nodeU, N nodeV) Returns anEndpointPairrepresenting the endpoints of an undirected edge.Methods inherited from class java.lang.Object
clone, finalize, getClass, notify, notifyAll, toString, wait, wait, waitMethods inherited from interface java.lang.Iterable
forEach, spliterator
-
Method Details
-
ordered
Returns anEndpointPairrepresenting the endpoints of a directed edge. -
unordered
Returns anEndpointPairrepresenting the endpoints of an undirected edge. -
source
If thisEndpointPairisOrdered(), returns the node which is the source.- Throws:
UnsupportedOperationException- if thisEndpointPairis not ordered
-
target
If thisEndpointPairisOrdered(), returns the node which is the target.- Throws:
UnsupportedOperationException- if thisEndpointPairis not ordered
-
nodeU
If thisEndpointPairisOrdered()returns thesource(); otherwise, returns an arbitrary (but consistent) endpoint of the origin edge. -
nodeV
Returns the nodeadjacenttonodeU()along the origin edge. If thisEndpointPairisOrdered(), this is equal totarget(). -
adjacentNode
Returns the node that is adjacent tonodealong the origin edge.- Throws:
IllegalArgumentException- if thisEndpointPairdoes not containnode- Since:
- 20.0 (but the argument type was changed from
ObjecttoNin 31.0)
-
isOrdered
public abstract boolean isOrdered()Returnstrueif thisEndpointPairis an ordered pair (i.e. represents the endpoints of a directed edge). -
iterator
-
equals
Two orderedEndpointPairs are equal if theirsource()andtarget()are equal. Two unorderedEndpointPairs are equal if they contain the same nodes. An orderedEndpointPairis never equal to an unorderedEndpointPair. -
hashCode
public abstract int hashCode()The hashcode of an orderedEndpointPairis equal toObjects.hash(source(), target()). The hashcode of an unorderedEndpointPairis equal tonodeU().hashCode() + nodeV().hashCode().
-