Revision 30907 trunk/extensions/extGraph/src/org/gvsig/graph/solvers/ShortestPathSolverDijkstra.java

View differences:

ShortestPathSolverDijkstra.java
199 199 
//				link = (GvEdge) node.getOutputLinks().get(linkNum);
200 200 
				idSiguienteNodo = link.getIdNodeEnd();
201 201 
				// To avoid U-turn
202 
				if (c.getFrom_link_c() == c.getEdgeIn().getIdEdge())
203 
					continue;
202 
				if (c.getEdgeIn() != null)
203 
					if (c.getFrom_link_c() == c.getEdgeIn().getIdEdge())
204 
						continue;
204 205 

  		




  205
  206
  
    
				toNode = graph.getNodeByID(idSiguienteNodo);


  		




  206
  207
  
    

  		












Also available in:  Unified diff