Revision 37909 trunk/extensions/extGraph/src/org/gvsig/graph/solvers/AbstractShortestPathSolver.java

View differences:

AbstractShortestPathSolver.java
141 141 

  		




  142
  142
  
    
		// Trazar el camino desde idEnd hasta idStart hacia atr?s marcando los


  		




  143
  143
  
    
		// Enlaces


  		




  
  144
  
    
		


  		




  
  145
  
    
		if (idStart == idEnd) {


  		




  
  146
  
    
			// Mismo punto.


  		




  
  147
  
    
			return;


  		




  
  148
  
    
		}


  		




  144
  149
  
    
		IGraph graph = net.getGraph();


  		




  145
  150
  
    
		node = graph.getNodeByID(idEnd);


  		




  146
  151
  
    
		int from_link = node.get_best_from_link();


  		












Also available in:  Unified diff