第äºè®²è·¯ç±å¨ç»æåè·¯ç±åè®®
第äºè®²è·¯ç±å¨ç»æåè·¯ç±åè®®
第äºè®²è·¯ç±å¨ç»æåè·¯ç±åè®®
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
A Link-State RoutingAlgorithmNotation: c(i,j): link cost fromnode i to j. cost infiniteif not direct neighbors D(v): current value ofcost of path fromsource to dest. V p(v): current node alongpath from source todest v N: set of nodes alreadyin spanning tree (leastcost path known)Examples:c(B,C) = 3D(E) = 2p(B) = AN = { A, B, D, E }2A153B23D E1C512F