Revision 30907

View differences:

trunk/extensions/extGraph/src/org/gvsig/graph/gui/ServiceAreaControlPanel.java
385 385
		solver.addListener(extractor);
386 386
		for (int i = 0; i < flags.length; i++) {
387 387
			String aux = (String) getTableModel().getValueAt(i, 2);
388
			if (aux == null) {
389
				JOptionPane.showMessageDialog((Component) PluginServices.getMainFrame(), PluginServices.getText(null, "please_introduce_some_costs")); 
390
			}
388 391
			double[] costs = NetworkUtils.string2doubleArray(aux, ",");
389 392
			Arrays.sort(costs);
390 393

  
trunk/extensions/extGraph/src/org/gvsig/graph/solvers/OneToManySolver.java
345 345
				idSiguienteNodo = link.getIdNodeEnd();
346 346
				
347 347
				// To avoid U-turn
348
				if (c.getFrom_link_c() == c.getEdgeIn().getIdEdge())
349
					continue;
348
				if (c.getEdgeIn() != null)
349
					if (c.getFrom_link_c() == c.getEdgeIn().getIdEdge())
350
						continue;
350 351

  
352

  
351 353
				
352 354
				toNode = graph.getNodeByID(idSiguienteNodo);
353 355

  
trunk/extensions/extGraph/src/org/gvsig/graph/solvers/ShortestPathSolverAStar.java
211 211
				idSiguienteNodo = link.getIdNodeEnd();
212 212
				
213 213
				// To avoid U-turn
214
				if (c.getFrom_link_c() == c.getEdgeIn().getIdEdge())
215
					continue;
214
				if (c.getEdgeIn() != null)
215
					if (c.getFrom_link_c() == c.getEdgeIn().getIdEdge())
216
						continue;
216 217

  
217 218
				toNode = graph.getNodeByID(idSiguienteNodo);
218 219
				
trunk/extensions/extGraph/src/org/gvsig/graph/solvers/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