Package | Description |
---|---|
com.google.common.graph |
An API for representing graph (node and edge) data.
|
Modifier and Type | Class and Description |
---|---|
private static class |
EndpointPair.Ordered<N> |
private static class |
EndpointPair.Unordered<N> |
Modifier and Type | Method and Description |
---|---|
protected EndpointPair<N> |
EndpointPairIterator.Directed.computeNext() |
protected EndpointPair<N> |
EndpointPairIterator.Undirected.computeNext() |
EndpointPair<N> |
Network.incidentNodes(java.lang.Object edge)
Returns the nodes which are the endpoints of
edge in this network. |
EndpointPair<N> |
Graphs.TransposedNetwork.incidentNodes(java.lang.Object edge) |
EndpointPair<N> |
ConfigurableNetwork.incidentNodes(java.lang.Object edge) |
(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. |
Modifier and Type | Method and Description |
---|---|
private java.util.Map<E,EndpointPair<N>> |
AbstractNetwork.edgeIncidentNodesMap() |
java.util.Set<EndpointPair<N>> |
ForwardingGraph.edges() |
java.util.Set<EndpointPair<N>> |
AbstractGraph.edges()
A reasonable default implementation of
Graph.edges() defined in terms of Graph.nodes() and Graph.successors(Object) . |
java.util.Set<EndpointPair<N>> |
Graph.edges()
Returns all edges in this graph.
|
private java.util.Map<EndpointPair<N>,V> |
AbstractValueGraph.edgeValueMap() |