Package | Description |
---|---|
org.codehaus.plexus.util.dag |
Modifier and Type | Field and Description |
---|---|
(package private) java.util.List<Vertex> |
Vertex.children |
(package private) java.util.List<Vertex> |
Vertex.parents |
private java.util.List<Vertex> |
DAG.vertexList
Conatin list of all vertices
|
private java.util.Map<java.lang.String,Vertex> |
DAG.vertexMap
Maps vertex's label to vertex
|
Modifier and Type | Method and Description |
---|---|
Vertex |
DAG.addVertex(java.lang.String label)
Adds vertex to DAG.
|
Vertex |
DAG.getVertex(java.lang.String label) |
Modifier and Type | Method and 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 and Description |
---|---|
void |
DAG.addEdge(Vertex from,
Vertex to) |
void |
Vertex.addEdgeFrom(Vertex vertex) |
void |
Vertex.addEdgeTo(Vertex vertex) |
private static boolean |
CycleDetector.dfsVisit(Vertex vertex,
java.util.LinkedList<java.lang.String> cycle,
java.util.Map<Vertex,java.lang.Integer> vertexStateMap) |
private static void |
TopologicalSorter.dfsVisit(Vertex vertex,
java.util.Map<Vertex,java.lang.Integer> vertexStateMap,
java.util.List<java.lang.String> list) |
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
|
private static boolean |
CycleDetector.isNotVisited(Vertex vertex,
java.util.Map<Vertex,java.lang.Integer> vertexStateMap) |
private static boolean |
TopologicalSorter.isNotVisited(Vertex vertex,
java.util.Map<Vertex,java.lang.Integer> vertexStateMap) |
private static boolean |
CycleDetector.isVisiting(Vertex vertex,
java.util.Map<Vertex,java.lang.Integer> vertexStateMap) |
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 and Description |
---|---|
private static boolean |
CycleDetector.dfsVisit(Vertex vertex,
java.util.LinkedList<java.lang.String> cycle,
java.util.Map<Vertex,java.lang.Integer> vertexStateMap) |
private static void |
TopologicalSorter.dfsVisit(Vertex vertex,
java.util.Map<Vertex,java.lang.Integer> vertexStateMap,
java.util.List<java.lang.String> list) |
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
|
private static boolean |
CycleDetector.isNotVisited(Vertex vertex,
java.util.Map<Vertex,java.lang.Integer> vertexStateMap) |
private static boolean |
TopologicalSorter.isNotVisited(Vertex vertex,
java.util.Map<Vertex,java.lang.Integer> vertexStateMap) |
private static boolean |
CycleDetector.isVisiting(Vertex vertex,
java.util.Map<Vertex,java.lang.Integer> vertexStateMap) |