vector directed graph library BUG2
|Reported by:||mmetz||Owned by:|
|Keywords:||shortest path, edge costs||Cc:|
If 2 nodes are connected by more arcs, SP doesn't return the shortest one but the last arc (between these two nodes) inserted to graph.
When building a graph and adding a new edge, check if there is already an edge connecting the two nodes. If the cost of the edge to be inserted is lower than the current cost connecting these two nodes, replace old edge, else don't add the new edge.
This could be done in https://trac.osgeo.org/grass/browser/grass/trunk/lib/vector/Vlib/net.c
Just an idea, needs testing.