Author: simonetripodi
Date: Tue Jun 21 16:44:14 2011
New Revision: 1138082

URL: http://svn.apache.org/viewvc?rev=1138082&view=rev
Log:
using LinkedHashSet preserves the order which edges are added

Modified:
    
commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/model/BaseMutableGraph.java

Modified: 
commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/model/BaseMutableGraph.java
URL: 
http://svn.apache.org/viewvc/commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/model/BaseMutableGraph.java?rev=1138082&r1=1138081&r2=1138082&view=diff
==============================================================================
--- 
commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/model/BaseMutableGraph.java
 (original)
+++ 
commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/model/BaseMutableGraph.java
 Tue Jun 21 16:44:14 2011
@@ -21,7 +21,7 @@ package org.apache.commons.graph.model;
 
 import static java.lang.String.format;
 
-import java.util.HashSet;
+import java.util.LinkedHashSet;
 
 import org.apache.commons.graph.Edge;
 import org.apache.commons.graph.Graph;
@@ -54,7 +54,7 @@ public abstract class BaseMutableGraph<V
             throw new GraphException( format( "Vertex '%s' already present in 
the Graph", v ) );
         }
 
-        getAdjacencyList().put( v, new HashSet<E>() );
+        getAdjacencyList().put( v, new LinkedHashSet<E>() );
 
         decorateAddVertex( v );
     }


Reply via email to