Hi All,
I am trying to figure out how to make driving distance calculation’s output columns edge_id and cost reasonable. For now they do not give any information but I need an accumulated cost for each edge(or vertex) from the source edge. I checked both drivedist.c and dijkstra.c but they do not have any difference in dijkstra implementation. But even dijkstra can output edge and cost information correctly, drivedist lacks that support.
What can be done for this problem ? I assume that boost dijkstra works the same way in both functions but what is the problem here ?
Thanks in advance,
/emre