Package | Description |
---|---|
eu.bandm.tools.graph |
Mathematical graph tools.
|
Modifier and Type | Class and Description |
---|---|
class |
AdHocRootedGraphModel<V> |
class |
DominatorTree<V>
Computes Dominator Forest.
|
class |
SCCGraphModel<V> |
Modifier and Type | Method and Description |
---|---|
static <V> RootedGraphModel<V> |
GraphModels.adjacentAllRoots(Multimap<V,? extends V> m) |
static <V> RootedGraphModel<V> |
GraphModels.adjacentAllRoots(Multimap<V,? extends V> m) |
RootedGraphModel<V> |
SCC.localGraphModel() |
RootedGraphModel<V> |
SCC.localGraphModel() |
static <V,W> RootedGraphModel<W> |
GraphModels.map(Function<? super V,? extends W> fun,
RootedGraphModel<V> parent) |
static <V,W> RootedGraphModel<W> |
GraphModels.map(Function<? super V,? extends W> fun,
RootedGraphModel<V> parent) |
Modifier and Type | Method and Description |
---|---|
static <V> Multimap<V,V> |
GraphModels.adjacency(RootedGraphModel<V> model) |
static <V> Multimap<V,V> |
GraphModels.adjacency(RootedGraphModel<V> model) |
<V> void |
GraphModels.dfs(Sink<? super V> sink,
boolean multiply,
RootedGraphModel<V> graph) |
<V> void |
GraphModels.dfs(Sink<? 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,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.postorder(RootedGraphModel<V> model) |
static <V> TopologicalSorter<V> |
GraphModels.preorder(RootedGraphModel<V> model) |
static <V> TopologicalSorter<V> |
GraphModels.preorder(RootedGraphModel<V> model) |
static <V> TopologicalSorter<V> |
GraphModels.reachable(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) |
static <V> SCCGraphModel<V> |
GraphModels.sccs(RootedGraphModel<V> parent,
boolean retainCycles) |
static <V> SCCGraphModel<V> |
GraphModels.sccs(RootedGraphModel<V> parent,
boolean retainCycles) |
static <V> TopologicalSorter<V> |
GraphModels.topsort(RootedGraphModel<V> model,
TraversalOrder order,
boolean weak) |
static <V> TopologicalSorter<V> |
GraphModels.topsort(RootedGraphModel<V> model,
TraversalOrder order,
boolean weak) |
Constructor and Description |
---|
DominatorTree(RootedGraphModel<V> graph) |
DominatorTree(RootedGraphModel<V> graph) |
SCCGraphModel(RootedGraphModel<V> parent) |
SCCGraphModel(RootedGraphModel<V> parent) |
SCCGraphModel(RootedGraphModel<V> parent,
boolean retainCycles) |
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.
|
TopologicalSorter(RootedGraphModel<V> model,
TraversalOrder order,
boolean weak)
Create an object that imposes an order on the nodes of a graph.
|
see also the complete user documentation .