All Classes and Interfaces

Class
Description
This class provides a skeletal implementation of Graph.
This class provides a skeletal implementation of Network.
This class provides a skeletal implementation of ValueGraph.
Used to represent the order of elements in a data structure that supports different options for iteration order guarantees.
The type of ordering that this object specifies.
An immutable pair representing the two endpoints of an edge in a graph.
An interface for graph-structured data, whose edges are anonymous entities with no identity or information of their own.
A builder for constructing instances of MutableGraph or ImmutableGraph with user-defined properties.
Static utility methods for Graph, ValueGraph, and Network instances.
A Graph whose elements and structural relationships will never change.
A builder for creating ImmutableGraph instances, especially static final graphs.
A Network whose elements and structural relationships will never change.
A builder for creating ImmutableNetwork instances, especially static final networks.
A ValueGraph whose elements and structural relationships will never change.
A builder for creating ImmutableValueGraph instances, especially static final graphs.
A subinterface of Graph which adds mutation methods.
A subinterface of Network which adds mutation methods.
A subinterface of ValueGraph which adds mutation methods.
An interface for graph-structured data, whose edges are unique objects.
A builder for constructing instances of MutableNetwork or ImmutableNetwork with user-defined properties.
A functional interface for graph-structured data.
A functional interface for graph-structured data.
An object that can traverse the nodes that are reachable from a specified (set of) start node(s) using a specified SuccessorsFunction.
An interface for graph-structured data, whose edges have associated non-unique values.
A builder for constructing instances of MutableValueGraph or ImmutableValueGraph with user-defined properties.