Class Router

java.lang.Object

Router

public class Router
extends java.lang.Object

This class provides a shortestPath method for finding routes between two points on the map. Start by using Dijkstra's, and if your code isn't fast enough for your satisfaction (or the autograder), upgrade your implementation by switching it to A*. Your code will probably not be fast enough to pass the autograder unless you use A*. The difference between A* and Dijkstra's is only a couple of lines of code, and boils down to the priority you use to order your vertices.

Constructor Summary

Constructors

Constructor and Description
Router()

Method Summary

Modifier and Type	Method and Description
static java.util.LinkedList<java.lang.Long>	shortestPath(GraphDB g, double stlon, double stlat, double destlon, double destlat) Return a LinkedList of Longs representing the shortest path from st to dest, where each long is a node ID.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

Router

public Router()

Method Detail

shortestPath

public static java.util.LinkedList<java.lang.Long> shortestPath(GraphDB g,
                                                                double stlon,
                                                                double stlat,
                                                                double destlon,
                                                                double destlat)

Return a LinkedList of Longs representing the shortest path from st to dest, where each long is a node ID.