You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@commons.apache.org by si...@apache.org on 2011/06/16 23:25:18 UTC
svn commit: r1136690 -
/commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/shortestpath/Dijkstra.java
Author: simonetripodi
Date: Thu Jun 16 21:25:17 2011
New Revision: 1136690
URL: http://svn.apache.org/viewvc?rev=1136690&view=rev
Log:
removed useless assertion verification, see line 106
Modified:
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/Dijkstra.java
URL: http://svn.apache.org/viewvc/commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/shortestpath/Dijkstra.java?rev=1136690&r1=1136689&r2=1136690&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 Thu Jun 16 21:25:17 2011
@@ -78,8 +78,6 @@ public final class Dijkstra
// extract the node with the shortest distance
while ( ( vertex = unsettledNodes.poll() ) != null )
{
- assert !settledNodes.contains( vertex );
-
// destination reached, stop and build the path
if ( target.equals( vertex ) )
{