Uses of Class
com.google.common.graph.EndpointPair

Packages that use EndpointPair

Package	Description
com.google.common.graph	An API for representing graph (node and edge) data.

Uses of EndpointPair in com.google.common.graph

Subclasses of EndpointPair in com.google.common.graph

Modifier and Type	Class	Description
private static class	EndpointPair.Ordered<N>
private static class	EndpointPair.Unordered<N>

Methods in com.google.common.graph that return EndpointPair

Modifier and Type	Method	Description
protected EndpointPair<N>	EndpointPairIterator.Directed.computeNext()
protected EndpointPair<N>	EndpointPairIterator.Undirected.computeNext()
EndpointPair<N>	ConfigurableNetwork.incidentNodes(E edge)
EndpointPair<N>	ForwardingNetwork.incidentNodes(E edge)
EndpointPair<N>	Graphs.TransposedNetwork.incidentNodes(E edge)
EndpointPair<N>	Network.incidentNodes(E edge)	Returns the nodes which are the endpoints of edge in this network.
(package private) static <N> EndpointPair<N>	EndpointPair.of(Graph<?> graph, N nodeU, N nodeV)	Returns an EndpointPair representing the endpoints of an edge in graph.
(package private) static <N> EndpointPair<N>	EndpointPair.of(Network<?,?> network, N nodeU, N nodeV)	Returns an EndpointPair representing the endpoints of an edge in network.
static <N> EndpointPair<N>	EndpointPair.ordered(N source, N target)	Returns an EndpointPair representing the endpoints of a directed edge.
static <N> EndpointPair<N>	EndpointPair.unordered(N nodeU, N nodeV)	Returns an EndpointPair representing the endpoints of an undirected edge.

Methods in com.google.common.graph that return types with arguments of type EndpointPair

Modifier and Type	Method	Description
private static <N,E> java.util.Map<E,EndpointPair<N>>	AbstractNetwork.edgeIncidentNodesMap(Network<N,E> network)
java.util.Set<EndpointPair<N>>	AbstractBaseGraph.edges()	An implementation of BaseGraph.edges() defined in terms of BaseGraph.nodes() and BaseGraph.successors(Object).
java.util.Set<EndpointPair<N>>	BaseGraph.edges()	Returns all edges in this graph.
java.util.Set<EndpointPair<N>>	Graph.edges()	Returns all edges in this graph.
java.util.Set<EndpointPair<N>>	ValueGraph.edges()	Returns all edges in this graph.
private static <N,V> java.util.Map<EndpointPair<N>,V>	AbstractValueGraph.edgeValueMap(ValueGraph<N,V> graph)
java.util.Set<EndpointPair<N>>	AbstractBaseGraph.incidentEdges(N node)
java.util.Set<EndpointPair<N>>	BaseGraph.incidentEdges(N node)	Returns the edges in this graph whose endpoints include node.
java.util.Set<EndpointPair<N>>	Graph.incidentEdges(N node)	Returns the edges in this graph whose endpoints include node.
java.util.Set<EndpointPair<N>>	ValueGraph.incidentEdges(N node)	Returns the edges in this graph whose endpoints include node.
UnmodifiableIterator<EndpointPair<N>>	AbstractBaseGraph.IncidentEdgeSet.Directed.iterator()
UnmodifiableIterator<EndpointPair<N>>	AbstractBaseGraph.IncidentEdgeSet.Undirected.iterator()