(package private) class |
AbstractBaseGraph<N> |
This class provides a skeletal implementation of BaseGraph .
|
(package private) class |
AbstractDirectedNetworkConnections<N,E> |
|
class |
AbstractGraph<N> |
This class provides a skeletal implementation of Graph .
|
(package private) class |
AbstractGraphBuilder<N> |
A base class for builders that construct graphs with user-defined properties.
|
class |
AbstractNetwork<N,E> |
This class provides a skeletal implementation of Network .
|
(package private) class |
AbstractUndirectedNetworkConnections<N,E> |
|
class |
AbstractValueGraph<N,V> |
This class provides a skeletal implementation of ValueGraph .
|
(package private) interface |
BaseGraph<N> |
A non-public interface for the methods shared between Graph and ValueGraph .
|
(package private) class |
DirectedGraphConnections<N,V> |
|
(package private) class |
DirectedMultiNetworkConnections<N,E> |
|
(package private) class |
DirectedNetworkConnections<N,E> |
|
(package private) class |
EdgesConnecting<E> |
A class to represent the set of edges connecting an (implicit) origin node to a target node.
|
class |
ElementOrder<T> |
Used to represent the order of elements in a data structure that supports different options for
iteration order guarantees.
|
class |
EndpointPair<N> |
An immutable pair representing the two endpoints of an edge in a graph.
|
(package private) class |
EndpointPairIterator<N> |
|
(package private) class |
ForwardingGraph<N> |
|
(package private) class |
ForwardingNetwork<N,E> |
A class to allow Network implementations to be backed by a provided delegate.
|
(package private) class |
ForwardingValueGraph<N,V> |
A class to allow ValueGraph implementations to be backed by a provided delegate.
|
interface |
Graph<N> |
An interface for graph-structured data,
whose edges are anonymous entities with no identity or information of their own.
|
class |
GraphBuilder<N> |
|
(package private) interface |
GraphConnections<N,V> |
An interface for representing and manipulating an origin node's adjacent nodes and edge values in
a Graph .
|
(package private) class |
GraphConstants |
A utility class to hold various constants used by the Guava Graph library.
|
class |
Graphs |
|
class |
ImmutableGraph<N> |
A Graph whose elements and structural relationships will never change.
|
class |
ImmutableNetwork<N,E> |
A Network whose elements and structural relationships will never change.
|
class |
ImmutableValueGraph<N,V> |
A ValueGraph whose elements and structural relationships will never change.
|
(package private) class |
IncidentEdgeSet<N> |
Abstract base class for an incident edges set that allows different implementations of AbstractCollection.iterator() .
|
(package private) class |
MapIteratorCache<K,V> |
|
(package private) class |
MapRetrievalCache<K,V> |
|
(package private) class |
MultiEdgesConnecting<E> |
A class to represent the set of edges connecting an (implicit) origin node to a target node.
|
interface |
MutableGraph<N> |
A subinterface of Graph which adds mutation methods.
|
interface |
MutableNetwork<N,E> |
A subinterface of Network which adds mutation methods.
|
interface |
MutableValueGraph<N,V> |
A subinterface of ValueGraph which adds mutation methods.
|
interface |
Network<N,E> |
An interface for graph-structured data,
whose edges are unique objects.
|
class |
NetworkBuilder<N,E> |
|
(package private) interface |
NetworkConnections<N,E> |
An interface for representing and manipulating an origin node's adjacent nodes and incident edges
in a Network .
|
interface |
PredecessorsFunction<N> |
A functional interface for graph-structured data.
|
(package private) class |
StandardMutableGraph<N> |
Standard implementation of MutableGraph that supports both directed and undirected
graphs.
|
(package private) class |
StandardMutableNetwork<N,E> |
Standard implementation of MutableNetwork that supports both directed and undirected
graphs.
|
(package private) class |
StandardMutableValueGraph<N,V> |
Standard implementation of MutableValueGraph that supports both directed and undirected
graphs.
|
(package private) class |
StandardNetwork<N,E> |
|
(package private) class |
StandardValueGraph<N,V> |
|
interface |
SuccessorsFunction<N> |
A functional interface for graph-structured data.
|
class |
Traverser<N> |
An object that can traverse the nodes that are reachable from a specified (set of) start node(s)
using a specified SuccessorsFunction .
|
(package private) class |
UndirectedGraphConnections<N,V> |
|
(package private) class |
UndirectedMultiNetworkConnections<N,E> |
|
(package private) class |
UndirectedNetworkConnections<N,E> |
|
interface |
ValueGraph<N,V> |
An interface for graph-structured data,
whose edges have associated non-unique values.
|
class |
ValueGraphBuilder<N,V> |
|