Equations from Tanenbaum

Work in progress - initial commit - no equations present yet
Improvements to implementation of Dijkstra's

Improvements to implementation of Dijkstra’s algorithm to separate it
out from implementation of a shortest path algorithm that called it.
Enables use by implementations of routing algorithms.
Initial work on Distance Vector Routing

Initial work - implementation not complete