Package | Description |
---|---|
classycle | |
classycle.dependency | |
classycle.graph |
Modifier and Type | Class and Description |
---|---|
class |
PackageVertex |
Modifier and Type | Method and Description |
---|---|
protected void |
PackageProcessor.finishProcessing(Vertex[] graph) |
protected void |
PackageProcessor.initializeProcessing(Vertex[] graph) |
protected void |
PackageProcessor.processAfter(Vertex vertex) |
protected void |
PackageProcessor.processArc(Vertex tail,
Vertex head) |
protected void |
PackageProcessor.processBefore(Vertex vertex) |
Modifier and Type | Method and Description |
---|---|
boolean |
PatternVertexCondition.isFulfilled(Vertex vertex) |
Constructor and Description |
---|
DependencyPathsRenderer(Vertex[] graph,
StringPattern startSetPattern,
StringPattern finalSetPattern) |
DependencyPathsRenderer(Vertex[] graph,
VertexCondition startSetCondition,
VertexCondition finalSetCondition) |
Modifier and Type | Class and Description |
---|---|
class |
AtomicVertex
A subclass of
Vertex with the following additional properties:
A flag indicating whether this vertex belongs to the graph or not. |
class |
StrongComponent
A strong component is a subgraph of a directed graph where every two
vertices are mutually reachable.
|
Modifier and Type | Method and Description |
---|---|
Vertex[] |
GraphAttributes.getBestFragmenters()
Returns those vertices of a
StrongComponent where the maximum
fragment size is equal to the best fragment size. |
Vertex[] |
GraphAttributes.getCenterVertices()
Returns the vertices of the center.
|
Vertex |
Vertex.getHeadVertex(int index)
Returns the head vertex of the specified outgoing arc.
|
Vertex |
Vertex.getTailVertex(int index)
Returns the tail vertex of the specified outgoing arc.
|
Modifier and Type | Method and Description |
---|---|
void |
Vertex.addIncomingArcTo(Vertex tailVertex)
Adds an incoming arc to the specified vertex.
|
void |
Vertex.addOutgoingArcTo(Vertex headVertex)
Adds an outgoing arc to the specified vertex.
|
int |
Vertex.compareTo(Vertex object) |
void |
GraphProcessor.deepSearchFirst(Vertex[] graph)
Performs a deep search first of the specified graph.
|
protected void |
StrongComponentProcessor.finishProcessing(Vertex[] graph)
Adds all arcs to the strong components.
|
protected void |
LongestWalkProcessor.finishProcessing(Vertex[] graph)
Finishes processing by sorting the result in accordance with the
walk length.
|
protected abstract void |
GraphProcessor.finishProcessing(Vertex[] graph)
Finishes processing.
|
protected void |
StrongComponentProcessor.initializeProcessing(Vertex[] graph) |
protected void |
LongestWalkProcessor.initializeProcessing(Vertex[] graph)
Does nothing.
|
protected abstract void |
GraphProcessor.initializeProcessing(Vertex[] graph)
Initializes processing.
|
boolean |
VertexCondition.isFulfilled(Vertex vertex)
Returns
true if the specified vertex fulfills the
condition. |
protected void |
GraphProcessor.process(Vertex vertex)
Processes the specified vertex.
|
protected void |
StrongComponentProcessor.processAfter(Vertex vertex)
Processes the specified vertex after all its outgoing arcs are
processed.
|
protected void |
LongestWalkProcessor.processAfter(Vertex vertex)
Deactivate the specified vertex.
|
protected abstract void |
GraphProcessor.processAfter(Vertex vertex)
Processes the specified vertex after its arcs have been processed.
|
protected void |
StrongComponentProcessor.processArc(Vertex tail,
Vertex head) |
protected void |
LongestWalkProcessor.processArc(Vertex tail,
Vertex head)
Processes arc from tail to head.
|
protected abstract void |
GraphProcessor.processArc(Vertex tail,
Vertex head)
Processes the arc specified by tail and head vertices.
|
protected void |
StrongComponentProcessor.processBefore(Vertex vertex) |
protected void |
LongestWalkProcessor.processBefore(Vertex vertex)
Resets the specified vertex.
|
protected abstract void |
GraphProcessor.processBefore(Vertex vertex)
Processes the specified vertex before its outgoing arcs are processed.
|