Uses of Interface
eu.bandm.tools.graph.RootedGraphModel

Packages that use RootedGraphModel

Package	Description
eu.bandm.tools.graph	Mathematical graph tools.

Uses of RootedGraphModel in eu.bandm.tools.graph

Classes in eu.bandm.tools.graph that implement RootedGraphModel

Modifier and Type	Class	Description
class	AdHocRootedGraphModel<V>
class	DominatorTree<V>	Computes Dominator Forest.
class	SCCGraphModel<V>

Methods in eu.bandm.tools.graph that return RootedGraphModel

Modifier and Type	Method	Description
static <V> RootedGraphModel<V>	GraphModels.adjacentAllRoots(Multimap<V,? extends V> m)
RootedGraphModel<V>	SCC.localGraphModel()
static <V, W> RootedGraphModel<W>	GraphModels.map(Function<? super V,? extends W> fun, RootedGraphModel<V> parent)

Methods in eu.bandm.tools.graph with parameters of type RootedGraphModel

Modifier and Type	Method	Description
static <V> Multimap<V,V>	GraphModels.adjacency(RootedGraphModel<V> model)
<V> void	GraphModels.dfs(Consumer<? super V> sink, boolean multiply, RootedGraphModel<V> graph)
static <V, W> RootedGraphModel<W>	GraphModels.map(Function<? super V,? extends W> fun, RootedGraphModel<V> parent)
static <V> TopologicalSorter<V>	GraphModels.postorder(RootedGraphModel<V> model)
static <V> TopologicalSorter<V>	GraphModels.preorder(RootedGraphModel<V> model)
static <V> TopologicalSorter<V>	GraphModels.reachable(RootedGraphModel<V> model)
static <V> SCCGraphModel<V>	GraphModels.sccs(RootedGraphModel<V> parent)
static <V> SCCGraphModel<V>	GraphModels.sccs(RootedGraphModel<V> parent, boolean retainCycles)
static <V> TopologicalSorter<V>	GraphModels.topsort(RootedGraphModel<V> model, TraversalOrder order, boolean weak)

Constructors in eu.bandm.tools.graph with parameters of type RootedGraphModel

Modifier	Constructor	Description
	DominatorTree(RootedGraphModel<V> graph)
	SCCGraphModel(RootedGraphModel<V> parent)
	SCCGraphModel(RootedGraphModel<V> parent, boolean retainCycles)
	TopologicalSorter(RootedGraphModel<V> model, TraversalOrder order, boolean weak)	Create an object that imposes an order on the nodes of a graph.