The Dijkstra algorithm tries to find the path between two nodes which have
the lowest cost (where cost could be f.ex. a property on each relationship).
So that algorithm calculates costs and sums them for each path it tries out.
Check out http://en.wikipedia.org/wiki/Dijkstra's_algorithm for more
Hi,
I have a graph representing a public transport network and I need
to aggravate the cost of a certain edge based on the previous chosen edge.
Can I do this with the Dijkstra algorithm in the Graph - Algo package?
I did not find anything pointing in that direction in the javadocs.
Thanks,
2 matches
Mail list logo
