第äºè®²è·¯ç±å¨ç»æåè·¯ç±åè®®
第äºè®²è·¯ç±å¨ç»æåè·¯ç±åè®®
第äºè®²è·¯ç±å¨ç»æåè·¯ç±åè®®
SHOW LESS
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
Distance Vector Algorithm:At all nodes, X:1 Initialization:2 for all adjacent nodes v:3 D X(*,v) = infinity /* the * operator means "for all rows" */X4 D (v,v) = c(X,v)5 for all destinations, yX6 send min D (y,w) to each neighbor /* w over all X's neighbors */w
Change language