## Uses of Class
org.codehaus.plexus.util.dag.Vertex

Packages that use Vertex
org.codehaus.plexus.util.dag: Directed Acyclic Graph utilities.

### Uses of Vertex in org.codehaus.plexus.util.dag

Methods in org.codehaus.plexus.util.dag that return Vertex
`Vertex` DAG.`addVertex(String label)` Adds vertex to DAG.
`Vertex` DAG.`getVertex(String label)`

Methods in org.codehaus.plexus.util.dag that return types with arguments of type Vertex
`List<Vertex>` Vertex.`getChildren()`
`List<Vertex>` Vertex.`getParents()` Get the list the most direct ancestors (parents).
`List<Vertex>` DAG.`getVerticies()`

Methods in org.codehaus.plexus.util.dag with parameters of type Vertex
`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)`

Method parameters in org.codehaus.plexus.util.dag with type arguments of type 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