Distance Vector Routing algorithm
The code finds shortest path from source to destination node using Distance Vector Routing algorithm
First it asks for number of nodes, then it generates a figure with nodes distributed in space with time delay between nodes. Then it computes shortest path using Distance Vector Routing algorithm as per the theoretical explanation given in Wikipedia link:
"http://en.wikipedia.org/wiki/Distance-vector_routing_protocol".
引用格式
suriyanath (2026). Distance Vector Routing algorithm (https://ww2.mathworks.cn/matlabcentral/fileexchange/46823-distance-vector-routing-algorithm), MATLAB Central File Exchange. 检索时间: .
