| Package | Description |
|---|---|
| com.google.common.graph |
An API for representing graph (node and edge) data.
|
| com.google.common.io |
This package contains utility methods and classes for working with Java I/O; for example input
streams, output streams, readers, writers, and files.
|
| Class and Description |
|---|
| AbstractBaseGraph
This class provides a skeletal implementation of
BaseGraph. |
| AbstractDirectedNetworkConnections
A base implementation of
NetworkConnections for directed networks. |
| AbstractGraph
This class provides a skeletal implementation of
Graph. |
| AbstractGraphBuilder
A base class for builders that construct graphs with user-defined properties.
|
| AbstractNetwork
This class provides a skeletal implementation of
Network. |
| AbstractUndirectedNetworkConnections
A base implementation of
NetworkConnections for undirected networks. |
| AbstractValueGraph
This class provides a skeletal implementation of
ValueGraph. |
| BaseGraph
A non-public interface for the methods shared between
Graph and ValueGraph. |
| DirectedGraphConnections
An implementation of
GraphConnections for directed graphs. |
| DirectedGraphConnections.NodeConnection
A value class representing single connection between the origin node and another node.
|
| DirectedMultiNetworkConnections
An implementation of
NetworkConnections for directed networks with parallel edges. |
| DirectedNetworkConnections
An implementation of
NetworkConnections for directed networks. |
| ElementOrder
Used to represent the order of elements in a data structure that supports different options for
iteration order guarantees.
|
| ElementOrder.Type
The type of ordering that this object specifies.
|
| ElementTypesAreNonnullByDefault
Marks all "top-level" types as non-null in a way that is recognized by Kotlin.
|
| EndpointPair
An immutable pair representing the two endpoints of an edge in a graph.
|
| EndpointPairIterator
A class to facilitate the set returned by
Graph.edges(). |
| ForwardingGraph |
| ForwardingNetwork
A class to allow
Network implementations to be backed by a provided delegate. |
| ForwardingValueGraph
A class to allow
ValueGraph implementations to be backed by a provided delegate. |
| Graph
An interface for graph-structured data,
whose edges are anonymous entities with no identity or information of their own.
|
| GraphBuilder
A builder for constructing instances of
MutableGraph or ImmutableGraph with
user-defined properties. |
| GraphConnections
An interface for representing and manipulating an origin node's adjacent nodes and edge values in
a
Graph. |
| GraphConstants.Presence
Singleton edge value for
Graph implementations backed by ValueGraphs. |
| Graphs.NodeVisitState
An enum representing the state of a node during DFS.
|
| ImmutableGraph
A
Graph whose elements and structural relationships will never change. |
| ImmutableGraph.Builder
A builder for creating
ImmutableGraph instances, especially static final
graphs. |
| ImmutableNetwork
A
Network whose elements and structural relationships will never change. |
| ImmutableNetwork.Builder
A builder for creating
ImmutableNetwork instances, especially static final
networks. |
| ImmutableValueGraph
A
ValueGraph whose elements and structural relationships will never change. |
| ImmutableValueGraph.Builder
A builder for creating
ImmutableValueGraph instances, especially static final
graphs. |
| MapIteratorCache
A map-like data structure that wraps a backing map and caches values while iterating through
MapIteratorCache.unmodifiableKeySet(). |
| MapRetrievalCache.CacheEntry |
| MutableGraph
A subinterface of
Graph which adds mutation methods. |
| MutableNetwork
A subinterface of
Network which adds mutation methods. |
| MutableValueGraph
A subinterface of
ValueGraph which adds mutation methods. |
| Network
An interface for graph-structured data,
whose edges are unique objects.
|
| NetworkBuilder
A builder for constructing instances of
MutableNetwork or ImmutableNetwork with
user-defined properties. |
| NetworkConnections
An interface for representing and manipulating an origin node's adjacent nodes and incident edges
in a
Network. |
| PredecessorsFunction
A functional interface for graph-structured data.
|
| StandardNetwork
Standard implementation of
Network that supports the options supplied by NetworkBuilder. |
| StandardValueGraph
Standard implementation of
ValueGraph that supports the options supplied by AbstractGraphBuilder. |
| SuccessorsFunction
A functional interface for graph-structured data.
|
| Traverser
An object that can traverse the nodes that are reachable from a specified (set of) start node(s)
using a specified
SuccessorsFunction. |
| Traverser.InsertionOrder
Poor man's method reference for
Deque::addFirst and Deque::addLast. |
| Traverser.Traversal
Abstracts away the difference between traversing a graph vs.
|
| UndirectedGraphConnections
An implementation of
GraphConnections for undirected graphs. |
| UndirectedMultiNetworkConnections
An implementation of
NetworkConnections for undirected networks with parallel edges. |
| UndirectedNetworkConnections
An implementation of
NetworkConnections for undirected networks. |
| ValueGraph
An interface for graph-structured data,
whose edges have associated non-unique values.
|
| ValueGraphBuilder
A builder for constructing instances of
MutableValueGraph or ImmutableValueGraph
with user-defined properties. |
| Class and Description |
|---|
| SuccessorsFunction
A functional interface for graph-structured data.
|
| Traverser
An object that can traverse the nodes that are reachable from a specified (set of) start node(s)
using a specified
SuccessorsFunction. |