Uses of Interface
com.google.common.graph.PredecessorsFunction
-
Packages that use PredecessorsFunction Package Description com.google.common.graph An API for representing graph (node and edge) data. -
-
Uses of PredecessorsFunction in com.google.common.graph
Subinterfaces of PredecessorsFunction in com.google.common.graph Modifier and Type Interface Description (package private) interface
com.google.common.graph.BaseGraph<N>
A non-public interface for the methods shared betweenGraph
andValueGraph
.interface
Graph<N>
An interface for graph-structured data, whose edges are anonymous entities with no identity or information of their own.interface
MutableGraph<N>
A subinterface ofGraph
which adds mutation methods.interface
MutableNetwork<N,E>
A subinterface ofNetwork
which adds mutation methods.interface
MutableValueGraph<N,V>
A subinterface ofValueGraph
which adds mutation methods.interface
Network<N,E>
An interface for graph-structured data, whose edges are unique objects.interface
ValueGraph<N,V>
An interface for graph-structured data, whose edges have associated non-unique values.Classes in com.google.common.graph that implement PredecessorsFunction Modifier and Type Class Description class
AbstractGraph<N>
This class provides a skeletal implementation ofGraph
.class
AbstractNetwork<N,E>
This class provides a skeletal implementation ofNetwork
.class
AbstractValueGraph<N,V>
This class provides a skeletal implementation ofValueGraph
.class
ImmutableGraph<N>
AGraph
whose elements and structural relationships will never change.class
ImmutableNetwork<N,E>
ANetwork
whose elements and structural relationships will never change.class
ImmutableValueGraph<N,V>
AValueGraph
whose elements and structural relationships will never change.
-