| Package | Description |
|---|---|
| com.google.common.graph |
An API for representing graph (node and edge) data.
|
| Class and Description |
|---|
| AbstractGraph
This class provides a skeletal implementation of
Graph. |
| AbstractNetwork
This class provides a skeletal implementation of
Network. |
| AbstractValueGraph
This class provides a skeletal implementation of
ValueGraph. |
| 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.
|
| EndpointPair
An immutable pair representing the two endpoints of an edge in a graph.
|
| 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 with user-defined properties. |
| ImmutableGraph
A
Graph whose elements and structural relationships will never change. |
| ImmutableNetwork
A
Network whose elements and structural relationships will never change. |
| ImmutableValueGraph
A
ValueGraph whose elements and structural relationships will never change. |
| 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 with user-defined properties. |
| PredecessorsFunction
A functional interface for graph-structured data.
|
| SuccessorsFunction
A functional interface for graph-structured data.
|
| Traverser
Provides methods for traversing a graph.
|
| ValueGraph
An interface for graph-structured data,
whose edges have associated non-unique values.
|
| ValueGraphBuilder
A builder for constructing instances of
MutableValueGraph with user-defined properties. |
Copyright © 2010–2017. All rights reserved.