Dijkstra Implementation: Find best route using the Dijkstra algorithm

This class can find best route using the Dijkstra algorithm.

There is an auxiliary class that encapsulates the functionality of a node through which a route may pass.

Links may be added between each node with the information of distance and whether there is a reciprocal link in the opposite direction.

The main class may the best routes between two nodes returning the information of the path nodes and associated costs.