Uses of Interface
com.google.common.graph.SuccessorsFunction
-
Packages that use SuccessorsFunction Package Description com.google.common.graph An API for representing graph (node and edge) data. -
-
Uses of SuccessorsFunction in com.google.common.graph
Subinterfaces of SuccessorsFunction 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 SuccessorsFunction 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.Methods in com.google.common.graph with parameters of type SuccessorsFunction Modifier and Type Method Description static <N> Traverser<N>
Traverser. forGraph(SuccessorsFunction<N> graph)
Creates a new traverser for the given generalgraph
.static <N> Traverser<N>
Traverser. forTree(SuccessorsFunction<N> tree)
Creates a new traverser for a directed acyclic graph that has at most one path from the start node(s) to any node reachable from the start node(s), and has no paths from any start node to any other start node, such as a tree or forest.
-