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 between Graph and ValueGraph.
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 of Graph which adds mutation methods.
interface	MutableNetwork<N,E>	A subinterface of Network which adds mutation methods.
interface	MutableValueGraph<N,V>	A subinterface of ValueGraph 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 of Graph.
class	AbstractNetwork<N,E>	This class provides a skeletal implementation of Network.
class	AbstractValueGraph<N,V>	This class provides a skeletal implementation of ValueGraph.
class	ImmutableGraph<N>	A Graph whose elements and structural relationships will never change.
class	ImmutableNetwork<N,E>	A Network whose elements and structural relationships will never change.
class	ImmutableValueGraph<N,V>	A ValueGraph 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 general graph.
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.