void |
DijkstraAlgorithm.execute(Vertex start,
Vertex destination) |
Run Dijkstra's shortest path algorithm.
|
Edge |
DefaultEdgeDirectory.getBestEdge(Vertex start,
Vertex end) |
Returns the best edge (the edge with the lowest penalty) between two given vertices.
|
java.util.Iterator |
DefaultEdgeDirectory.getDestinations(Vertex origin) |
Returns an iterator over all valid destinations for a given vertex.
|
protected java.util.Iterator |
DijkstraAlgorithm.getDestinations(Vertex origin) |
Returns an iterator over all valid destinations for a given vertex.
|
java.util.Iterator |
EdgeDirectory.getDestinations(Vertex origin) |
Returns an iterator over all valid destinations for a given vertex.
|
java.util.Iterator |
DefaultEdgeDirectory.getEdges(Vertex origin) |
Returns an iterator over all edges with the given origin.
|
int |
DijkstraAlgorithm.getLowestPenalty(Vertex vertex) |
Returns the lowest penalty from the start point to a given vertex.
|
int |
DefaultEdgeDirectory.getPenalty(Vertex start,
Vertex end) |
Returns the penalty between two vertices.
|
protected int |
DijkstraAlgorithm.getPenalty(Vertex start,
Vertex end) |
Returns the penalty between two vertices.
|
int |
EdgeDirectory.getPenalty(Vertex start,
Vertex end) |
Returns the penalty between two vertices.
|
Vertex |
DijkstraAlgorithm.getPredecessor(Vertex vertex) |
Returns the vertex's predecessor on the shortest path.
|
private boolean |
DijkstraAlgorithm.isFinished(Vertex v) |
Indicates whether a shortest route to a vertex has been found.
|
private void |
DijkstraAlgorithm.relax(Vertex u) |
Compute new lowest penalties for neighboring vertices.
|
private void |
DijkstraAlgorithm.setPredecessor(Vertex a,
Vertex b) |
|
private void |
DijkstraAlgorithm.setShortestDistance(Vertex vertex,
int distance) |
|