So, guys, now we enter into the phase two of the routing table construction procedure.
The phase two is all about applying the algorithm on the input graph data structure, which is built
in the phase one.
So the algorithm is famously known as shortest path first algorithm.
So each routing device of the topology runs SBF algorithm, which is shortest path, first algorithm
named after Dijkstra on its local link state database.
And the result of applying this shortest path.
First algorithm on link state database is that that a routing device is able to compute the shortest
path to reach each routing device present in the network graph.
Right now, this shortest path information shall be used in phase three in order to compute the routing
table.
So before proceeding further in this phase, you are advised to revise Dijkstra algorithm from your
standard textbook so that you have a rough idea regarding how Dijkstra algorithm works.
And then we will discuss that, how this Dijkstra algorithm has been molded slightly so that it fits
in the computation of routing table.
So please proceed ahead only after revising Dijkstra's algorithm from your standard textbooks.