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://kr.mathworks.com/matlabcentral/fileexchange/46823-distance-vector-routing-algorithm), MATLAB Central File Exchange. 검색 날짜: .
