Package | Description |
---|---|
classycle | |
classycle.dependency | |
classycle.graph | |
classycle.renderer |
Class and Description |
---|
AtomicVertex
A subclass of
Vertex with the following additional properties:
A flag indicating whether this vertex belongs to the graph or not. |
Attributes
Interface of any general set of attributes a
Vertex may
have. |
GraphProcessor
Abstract class for all algorithms based on deep search first.
|
NameAttributes |
StrongComponent
A strong component is a subgraph of a directed graph where every two
vertices are mutually reachable.
|
Vertex
The base class for any type of vertex in a directed graph.
|
Class and Description |
---|
AtomicVertex
A subclass of
Vertex with the following additional properties:
A flag indicating whether this vertex belongs to the graph or not. |
StrongComponent
A strong component is a subgraph of a directed graph where every two
vertices are mutually reachable.
|
Vertex
The base class for any type of vertex in a directed graph.
|
VertexCondition
Interface of classes which determine whether a
Vertex
fulfills a condition or not. |
Class and Description |
---|
AtomicVertex
A subclass of
Vertex with the following additional properties:
A flag indicating whether this vertex belongs to the graph or not. |
Attributes
Interface of any general set of attributes a
Vertex may
have. |
GraphProcessor
Abstract class for all algorithms based on deep search first.
|
StrongComponent
A strong component is a subgraph of a directed graph where every two
vertices are mutually reachable.
|
Vertex
The base class for any type of vertex in a directed graph.
|
VertexCondition
Interface of classes which determine whether a
Vertex
fulfills a condition or not. |
Class and Description |
---|
AtomicVertex
A subclass of
Vertex with the following additional properties:
A flag indicating whether this vertex belongs to the graph or not. |
StrongComponent
A strong component is a subgraph of a directed graph where every two
vertices are mutually reachable.
|