Menu

Commit [r8086]  Maximize  Restore  History

an extended implementation of Dijkstra's least-cost-path algorithm that supports multiple nodes as (possible) start and end.

mrieser 2009-07-26

added /matsim/trunk/src/playground/marcel/pt/router/MultiNodeDijkstra.java
changed /matsim/trunk/test/src/playground/marcel/pt/router/AllTests.java
added /matsim/trunk/test/src/playground/marcel/pt/router/MultiNodeDijkstraTest.java
/matsim/trunk/src/playground/marcel/pt/router/MultiNodeDijkstra.java Diff Switch to side-by-side view
Loading...
/matsim/trunk/test/src/playground/marcel/pt/router/AllTests.java Diff Switch to side-by-side view
Loading...
/matsim/trunk/test/src/playground/marcel/pt/router/MultiNodeDijkstraTest.java Diff Switch to side-by-side view
Loading...
Want the latest updates on software, tech news, and AI?
Get latest updates about software, tech news, and AI from SourceForge directly in your inbox once a month.