spelling: getVertices

This closes #18

Author: jsoref

src/main/java/org/codehaus/plexus/util/dag/CycleDetector.java

@@ -38,13 +38,13 @@ public class CycleDetector
 
     public static List<String> hasCycle( final DAG graph )
     {
-        final List<Vertex> verticies = graph.getVerticies();
+        final List<Vertex> vertices = graph.getVertices();
 
         final Map<Vertex, Integer> vertexStateMap = new HashMap<Vertex, Integer>();
 
         List<String> retValue = null;
 
-        for ( Vertex vertex : verticies )
+        for ( Vertex vertex : vertices )
         {
             if ( isNotVisited( vertex, vertexStateMap ) )
             {

src/main/java/org/codehaus/plexus/util/dag/DAG.java

@@ -45,7 +45,7 @@ public class DAG implements Cloneable, Serializable
     private Map<String, Vertex> vertexMap = new HashMap<String, Vertex>();
 
     /**
-     * Contain list of all verticies
+     * Conatin list of all vertices
      */
     private List<Vertex> vertexList = new ArrayList<Vertex>();
 
@@ -68,11 +68,19 @@ public DAG()
     /**
      * @return
      */
-    public List<Vertex> getVerticies()
+    public List<Vertex> getVertices()
     {
         return vertexList;
     }
 
+    /**
+     * @deprecated instead use {@link #getVertices()}
+     */
+    @Deprecated
+    public List<Vertex> getVerticies()
+    {
+        return getVertices();
+    }
 
     public Set<String> getLabels()
     {

src/main/java/org/codehaus/plexus/util/dag/TopologicalSorter.java

@@ -61,7 +61,7 @@ private static List<String> dfs( final DAG graph )
         final List<String> retValue = new LinkedList<String>();
         final Map<Vertex, Integer> vertexStateMap = new HashMap<Vertex, Integer>();
 
-        for ( Vertex vertex : graph.getVerticies() )
+        for ( Vertex vertex : graph.getVertices() )
         {
             if ( isNotVisited( vertex, vertexStateMap ) )
             {

src/test/java/org/codehaus/plexus/util/dag/DAGTest.java

@@ -36,19 +36,19 @@ public void testDAG()
 
         dag.addVertex( "a" );
 
-        assertEquals( 1, dag.getVerticies().size() );
+        assertEquals( 1, dag.getVertices().size() );
 
         assertEquals( "a", dag.getVertex( "a" ).getLabel() );
 
         dag.addVertex( "a" );
 
-        assertEquals( 1, dag.getVerticies().size() );
+        assertEquals( 1, dag.getVertices().size() );
 
         assertEquals( "a", dag.getVertex( "a" ).getLabel() );
 
         dag.addVertex( "b" );
 
-        assertEquals( 2, dag.getVerticies().size() );
+        assertEquals( 2, dag.getVertices().size() );
 
         assertFalse( dag.hasEdge( "a", "b" ) );
 
@@ -74,7 +74,7 @@ public void testDAG()
 
         dag.addEdge( "c", "d" );
 
-        assertEquals( 4, dag.getVerticies().size() );
+        assertEquals( 4, dag.getVertices().size() );
 
         final Vertex c = dag.getVertex( "c" );