| Package | Description |
|---|---|
| org.codehaus.plexus.util.dag |
| Modifier and Type | Method | Description |
|---|---|---|
Vertex |
DAG.addVertex(java.lang.String label) |
Adds vertex to DAG.
|
Vertex |
DAG.getVertex(java.lang.String label) |
| Modifier and Type | Method | Description |
|---|---|---|
java.util.List<Vertex> |
Vertex.getChildren() |
|
java.util.List<Vertex> |
Vertex.getParents() |
Get the list the most direct ancestors (parents).
|
java.util.List<Vertex> |
DAG.getVertices() |
|
java.util.List<Vertex> |
DAG.getVerticies() |
Deprecated.
instead use
DAG.getVertices() |
| Modifier and Type | Method | Description |
|---|---|---|
void |
DAG.addEdge(Vertex from,
Vertex to) |
|
void |
Vertex.addEdgeFrom(Vertex vertex) |
|
void |
Vertex.addEdgeTo(Vertex vertex) |
|
static java.util.List<java.lang.String> |
CycleDetector.introducesCycle(Vertex vertex) |
|
static java.util.List<java.lang.String> |
CycleDetector.introducesCycle(Vertex vertex,
java.util.Map<Vertex,java.lang.Integer> vertexStateMap) |
This method will be called when an edge leading to given vertex was added and we want to check if introduction of
this edge has not resulted in apparition of cycle in the graph
|
void |
DAG.removeEdge(Vertex from,
Vertex to) |
|
void |
Vertex.removeEdgeFrom(Vertex vertex) |
|
void |
Vertex.removeEdgeTo(Vertex vertex) |
|
static java.util.List<java.lang.String> |
TopologicalSorter.sort(Vertex vertex) |
| Modifier and Type | Method | Description |
|---|---|---|
static java.util.List<java.lang.String> |
CycleDetector.introducesCycle(Vertex vertex,
java.util.Map<Vertex,java.lang.Integer> vertexStateMap) |
This method will be called when an edge leading to given vertex was added and we want to check if introduction of
this edge has not resulted in apparition of cycle in the graph
|