| |
|
| java.lang.Object classycle.graph.GraphProcessor classycle.graph.StrongComponentProcessor
StrongComponentProcessor | public class StrongComponentProcessor extends GraphProcessor (Code) | | A processor which extracts the strong components of a directed graph.
A strong component is a maximal strongly connected subgraph of a
directed graph. The implementation is based on Tarjan's algorithm.
author: Franz-Josef Elmer |
Constructor Summary | |
public | StrongComponentProcessor(boolean calculateAttributes) Creates an instance.
Parameters: calculateAttributes - If true the attributes of thestrong components will be calculated. |
StrongComponentProcessor | public StrongComponentProcessor(boolean calculateAttributes)(Code) | | Creates an instance.
Parameters: calculateAttributes - If true the attributes of thestrong components will be calculated. Otherwise not. |
finishProcessing | protected void finishProcessing(Vertex[] graph)(Code) | | Adds all arcs to the strong components. There is an arc from a strong
component to another one if there is at least one arc from a vertex
of one component to a vertex the other one.
|
initializeProcessing | protected void initializeProcessing(Vertex[] graph)(Code) | | |
|
|
|