PHP Shortest Path algoritm: Find the shortest path between two locations

This class can find the shortest path between two locations.

It can take as parameter the identifier of the starting node of a map of known locations stored in a database.

The class can lookup on the database the neighbor nodes until it reaches a destination nodes through several possible routes and applies an algorithm to find which of the routes is the shortest.