Description: Simplified version of a system that finds the fastest or shortest trip along a network of roads, is an instance of the single-source, positive-weighted, shortest-path problem. In other words, from one particular vertex (a “single source”), we’ll be finding the shortest path to another vertex where all of the edges have a “positive weight” (in our case, distance or speed) associated with them.
To Search:
File list (Check if you may need any files):
test.4
test.5
test.6
Location.java
PriorityQueue.java
README.txt
Result.java
RoadSegment.java
RockAndRoll.java
Trip.java
test.0
test.1
test.2
test.3
Download