Shortest Path First algorithm
At each step:
- Find the node amongst all nodes on TENT that has the lowest cost, and move it from TENT into PATHS
- Find all prefixes advertised by this node and install them in the RIB
- Find all neighbours reachable from that node and move them into TENT