title: Link state routing protocol - Dijkstras Algorithm
body: <p><a href="https://i.stack.imgur.com/5vckl.png" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/5vckl.png" alt="enter image description here"></a></p>
  
  <p>N- Network
  R- Router</p>
  
  <p>In the above picture, you can see a question about link state routing protocol. When you are doing the <strong>Dijkstra algorithm for R3</strong> for this, I know you start off by adding N3 and N4 then look at the cost, 2 is less than 4 so N4 becomes permanent but when N4 becomes permanent does it add R4 and R7 or do you just pick one of them?</p>