| AtomicVertex |
A subclass of Vertex with the following additional properties:
A flag indicating whether this vertex belongs to the graph or not. |
| GraphProcessor |
Abstract class for all algorithms based on deep search first.
|
| LongestWalkProcessor |
Calculates for each vertex the longest walk.
|
| NameAttributes |
|
| PathsFinder |
Class searching for all (or only the shortest) paths between classes
of a start set and classes of a final set.
|
| StrongComponent |
A strong component is a subgraph of a directed graph where every two
vertices are mutually reachable.
|
| StrongComponentAnalyser |
Analyser of a directed graph for finding its strong components.
|
| StrongComponentProcessor |
A processor which extracts the strong components of a directed graph.
|
| Vertex |
The base class for any type of vertex in a directed graph.
|