Skip to content

Commit

Permalink
Merge pull request #497 from Dao007forever/master
Browse files Browse the repository at this point in the history
Use LinkedHashMap so that the topological sort will process the nodes in the same order.
  • Loading branch information
cbeust committed Mar 22, 2014
2 parents e5da288 + 57462ca commit 9fba521
Showing 1 changed file with 1 addition and 1 deletion.
2 changes: 1 addition & 1 deletion src/main/java/org/testng/internal/Graph.java
Expand Up @@ -19,7 +19,7 @@
*/
public class Graph<T> {
private static boolean m_verbose = false;
private Map<T, Node<T>> m_nodes = Maps.newHashMap();
private Map<T, Node<T>> m_nodes = Maps.newLinkedHashMap();
private List<T> m_strictlySortedNodes = null;

// A map of nodes that are not the predecessors of any node
Expand Down

0 comments on commit 9fba521

Please sign in to comment.