Author: simonetripodi Date: Wed Jun 29 01:46:09 2011 New Revision: 1140941 URL: http://svn.apache.org/viewvc?rev=1140941&view=rev Log: used proper Queue methods
Modified: commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/shortestpath/AStar.java commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/shortestpath/Dijkstra.java Modified: commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/shortestpath/AStar.java URL: http://svn.apache.org/viewvc/commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/shortestpath/AStar.java?rev=1140941&r1=1140940&r2=1140941&view=diff ============================================================================== --- commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/shortestpath/AStar.java (original) +++ commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/shortestpath/AStar.java Wed Jun 29 01:46:09 2011 @@ -73,7 +73,7 @@ public final class AStar // The set of tentative nodes to be evaluated. final PriorityQueue<V> openSet = new PriorityQueue<V>( graph.getOrder(), fScores ); - openSet.add( start ); + openSet.offer( start ); // The of navigated nodes final PredecessorsList<V, WE> predecessors = new PredecessorsList<V, WE>( graph ); Modified: commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/shortestpath/Dijkstra.java URL: http://svn.apache.org/viewvc/commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/shortestpath/Dijkstra.java?rev=1140941&r1=1140940&r2=1140941&view=diff ============================================================================== --- commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/shortestpath/Dijkstra.java (original) +++ commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/shortestpath/Dijkstra.java Wed Jun 29 01:46:09 2011 @@ -62,7 +62,7 @@ public final class Dijkstra shortestDistances.setWeight( source, 0D ); final PriorityQueue<V> unsettledNodes = new PriorityQueue<V>( graph.getOrder(), shortestDistances ); - unsettledNodes.add( source ); + unsettledNodes.offer( source ); final Set<V> settledNodes = new HashSet<V>();