GitHub/quartz
1
0
Fork 2
mirror of https://github.com/jackyzha0/quartz.git synced 2025-12-27 14:54:05 -06:00
Code Issues Actions Packages Projects Releases Wiki Activity

vault backup: 2022-10-18 12:39:16

Browse Source
This commit is contained in:
Jet Hughes 2022-10-18 12:39:16 +13:00
parent 59f8da0025
commit ec7da009fa
1 changed files with 9 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
content/notes/20-network-layer-control-plane.md
View File

@ -60,15 +60,17 @@ iterative: after k interations, know least cost path to k destinations
![](https://i.imgur.com/NfrM72Y.png) ![](https://i.imgur.com/NfrM72Y.png)
## Dijkstra's algorithm ## Dijkstra's algorithm
foward search algorithm
initialization
``` ```
///initialization
N` = {u} N` = {u}
for all nodes v for all nodes v
if v adjacent to u if v adjacent to u
then D(v) = Cuv then D(v) = Cuv
else D(v) = infinity else D(v) = infinity
//loop
loop until all nodes in N` loop until all nodes in N`
find W not in N` such that D(w) is a min find W not in N` such that D(w) is a min
add w to N` add w to N`
@ -78,6 +80,12 @@ loop until all nodes in N`
``` ```
![example](https://i.imgur.com/zeR9DAI.png)
complexity:
- n nodes
- O(n)
# routing in the internet # routing in the internet
# ICMP # ICMP