Distance Vector Routing algorithm
The code finds shortest path from source to destination node using Distance Vector Routing algorithm
Al momento, stai seguendo questo contributo
- Vedrai gli aggiornamenti nel tuo feed del contenuto seguito
- Potresti ricevere delle email a seconda delle tue preferenze per le comunicazioni
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".
Cita come
suriyanath (2026). Distance Vector Routing algorithm (https://it.mathworks.com/matlabcentral/fileexchange/46823-distance-vector-routing-algorithm), MATLAB Central File Exchange. Recuperato .
Informazioni generali
- Versione 1.1.0.0 (2,27 KB)
Compatibilità della release di MATLAB
- Compatibile con qualsiasi release
Compatibilità della piattaforma
- Windows
- macOS
- Linux
