Package | Description |
---|---|
org.codehaus.plexus.util.dag |
Directed Acyclic Graph utilities.
|
Modifier and Type | Method and Description |
---|---|
Vertex |
DAG.addVertex(String label)
Adds vertex to DAG.
|
Vertex |
DAG.getVertex(String label) |
Modifier and Type | Method and Description |
---|---|
List<Vertex> |
Vertex.getChildren() |
List<Vertex> |
Vertex.getParents()
Get the list the most direct ancestors (parents).
|
List<Vertex> |
DAG.getVerticies() |
Modifier and Type | Method and Description |
---|---|
void |
DAG.addEdge(Vertex from,
Vertex to) |
void |
Vertex.addEdgeFrom(Vertex vertex) |
void |
Vertex.addEdgeTo(Vertex vertex) |
static List<String> |
CycleDetector.introducesCycle(Vertex vertex) |
static List<String> |
CycleDetector.introducesCycle(Vertex vertex,
Map<Vertex,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 List<String> |
TopologicalSorter.sort(Vertex vertex) |
Modifier and Type | Method and Description |
---|---|
static List<String> |
CycleDetector.introducesCycle(Vertex vertex,
Map<Vertex,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
|
Copyright © 2001-2013 Codehaus. All Rights Reserved.