| Package | Description |
|---|---|
| net.automatalib.algorithms.graph | |
| net.automatalib.algorithms.graph.scc |
| Modifier and Type | Method and Description |
|---|---|
static <N,E> void |
GraphAlgorithms.findSCCs(Graph<N,E> graph,
SCCListener<N> sccListener)
Find all strongly-connected components in a graph.
|
| Modifier and Type | Class and Description |
|---|---|
class |
SCCCollector<N> |
| Modifier and Type | Method and Description |
|---|---|
static <N,E> void |
SCCs.findSCCs(Graph<N,E> graph,
SCCListener<N> listener)
Find all strongly-connected components in a graph.
|
| Constructor and Description |
|---|
TarjanSCCVisitor(Graph<N,E> graph,
SCCListener<N> listener)
Constructor.
|
Copyright © 2013. All Rights Reserved.