Dijkastra Algorithm in vehicular adhoc network

조회 수: 7 (최근 30일)
Vartika Agarwal
Vartika Agarwal 2021년 12월 18일
I want to apply dijkastra algorithm for vehicular adhoc network.
If we have 4 vehicles in a path and 1 vehicle will automatically remove from path and another vehicle enter. Algorithm automatically count those vehicles which are in a path.
How can i code. I am trying this code
https://in.mathworks.com/matlabcentral/fileexchange/36140-dijkstra-algorithm
But it does not working properly.

이 질문에 답변하려면 로그인하십시오.

답변 (0개)

카테고리

Help Center 및 File Exchange에서 Vehicle Network Toolbox에 대해 자세히 알아보기

태그

제품

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by