@ParametersAreNonnullByDefault
See: Description
Interface | Description |
---|---|
BaseGraph<N> |
A non-public interface for the methods shared between
Graph and ValueGraph . |
Graph<N> |
An interface for graph-structured data,
whose edges are anonymous entities with no identity or information of their own.
|
GraphConnections<N,V> |
An interface for representing and manipulating an origin node's adjacent nodes and edge values in
a
Graph . |
MutableGraph<N> |
A subinterface of
Graph which adds mutation methods. |
MutableNetwork<N,E> |
A subinterface of
Network which adds mutation methods. |
MutableValueGraph<N,V> |
A subinterface of
ValueGraph which adds mutation methods. |
Network<N,E> |
An interface for graph-structured data,
whose edges are unique objects.
|
NetworkConnections<N,E> |
An interface for representing and manipulating an origin node's adjacent nodes and incident edges
in a
Network . |
PredecessorsFunction<N> |
A functional interface for graph-structured data.
|
SuccessorsFunction<N> |
A functional interface for graph-structured data.
|
ValueGraph<N,V> |
An interface for graph-structured data,
whose edges have associated non-unique values.
|
Class | Description |
---|---|
AbstractBaseGraph<N> |
This class provides a skeletal implementation of
BaseGraph . |
AbstractBaseGraph.IncidentEdgeSet<N> | |
AbstractBaseGraph.IncidentEdgeSet.Directed<N> | |
AbstractBaseGraph.IncidentEdgeSet.Undirected<N> | |
AbstractDirectedNetworkConnections<N,E> |
A base implementation of
NetworkConnections for directed networks. |
AbstractGraph<N> |
This class provides a skeletal implementation of
Graph . |
AbstractGraphBuilder<N> |
A base class for builders that construct graphs with user-defined properties.
|
AbstractNetwork<N,E> |
This class provides a skeletal implementation of
Network . |
AbstractUndirectedNetworkConnections<N,E> |
A base implementation of
NetworkConnections for undirected networks. |
AbstractValueGraph<N,V> |
This class provides a skeletal implementation of
ValueGraph . |
ConfigurableMutableGraph<N> |
Configurable implementation of
MutableGraph that supports both directed and undirected
graphs. |
ConfigurableMutableNetwork<N,E> |
Configurable implementation of
MutableNetwork that supports both directed and undirected
graphs. |
ConfigurableMutableValueGraph<N,V> |
Configurable implementation of
MutableValueGraph that supports both directed and
undirected graphs. |
ConfigurableNetwork<N,E> |
Configurable implementation of
Network that supports the options supplied by NetworkBuilder . |
ConfigurableValueGraph<N,V> |
Configurable implementation of
ValueGraph that supports the options supplied by AbstractGraphBuilder . |
DirectedGraphConnections<N,V> |
An implementation of
GraphConnections for directed graphs. |
DirectedGraphConnections.PredAndSucc |
A wrapper class to indicate a node is both a predecessor and successor while still providing
the successor value.
|
DirectedMultiNetworkConnections<N,E> |
An implementation of
NetworkConnections for directed networks with parallel edges. |
DirectedNetworkConnections<N,E> |
An implementation of
NetworkConnections for directed networks. |
EdgesConnecting<E> |
A class to represent the set of edges connecting an (implicit) origin node to a target node.
|
ElementOrder<T> |
Used to represent the order of elements in a data structure that supports different options for
iteration order guarantees.
|
EndpointPair<N> |
An immutable pair representing the two endpoints of an edge in a graph.
|
EndpointPair.Ordered<N> | |
EndpointPair.Unordered<N> | |
EndpointPairIterator<N> |
A class to facilitate the set returned by
Graph.edges() . |
EndpointPairIterator.Directed<N> |
If the graph is directed, each ordered [source, target] pair will be visited once if there is
an edge connecting them.
|
EndpointPairIterator.Undirected<N> |
If the graph is undirected, each unordered [node, otherNode] pair (except self-loops) will be
visited twice if there is an edge connecting them.
|
ForwardingGraph<N> | |
ForwardingNetwork<N,E> |
A class to allow
Network implementations to be backed by a provided delegate. |
ForwardingValueGraph<N,V> |
A class to allow
ValueGraph implementations to be backed by a provided delegate. |
GraphBuilder<N> |
A builder for constructing instances of
MutableGraph or ImmutableGraph with
user-defined properties. |
GraphConstants |
A utility class to hold various constants used by the Guava Graph library.
|
Graphs | |
Graphs.TransposedGraph<N> | |
Graphs.TransposedNetwork<N,E> | |
Graphs.TransposedValueGraph<N,V> | |
ImmutableGraph<N> |
A
Graph whose elements and structural relationships will never change. |
ImmutableGraph.Builder<N> |
A builder for creating
ImmutableGraph instances, especially static final
graphs. |
ImmutableNetwork<N,E> |
A
Network whose elements and structural relationships will never change. |
ImmutableNetwork.Builder<N,E> |
A builder for creating
ImmutableNetwork instances, especially static final
networks. |
ImmutableValueGraph<N,V> |
A
ValueGraph whose elements and structural relationships will never change. |
ImmutableValueGraph.Builder<N,V> |
A builder for creating
ImmutableValueGraph instances, especially static final
graphs. |
MapIteratorCache<K,V> |
A map-like data structure that wraps a backing map and caches values while iterating through
MapIteratorCache.unmodifiableKeySet() . |
MapRetrievalCache<K,V> |
A
MapIteratorCache that adds additional caching. |
MapRetrievalCache.CacheEntry<K,V> | |
MultiEdgesConnecting<E> |
A class to represent the set of edges connecting an (implicit) origin node to a target node.
|
NetworkBuilder<N,E> |
A builder for constructing instances of
MutableNetwork or ImmutableNetwork with
user-defined properties. |
Traverser<N> |
An object that can traverse the nodes that are reachable from a specified (set of) start node(s)
using a specified
SuccessorsFunction . |
Traverser.GraphTraverser<N> | |
Traverser.TreeTraverser<N> | |
UndirectedGraphConnections<N,V> |
An implementation of
GraphConnections for undirected graphs. |
UndirectedMultiNetworkConnections<N,E> |
An implementation of
NetworkConnections for undirected networks with parallel edges. |
UndirectedNetworkConnections<N,E> |
An implementation of
NetworkConnections for undirected networks. |
ValueGraphBuilder<N,V> |
A builder for constructing instances of
MutableValueGraph or ImmutableValueGraph
with user-defined properties. |
Enum | Description |
---|---|
ElementOrder.Type |
The type of ordering that this object specifies.
|
GraphConstants.Presence |
Singleton edge value for
Graph implementations backed by ValueGraph s. |
Graphs.NodeVisitState |
An enum representing the state of a node during DFS.
|
Traverser.Order |
This package is a part of the open-source Guava library.