Dijkastra Algorithm in vehicular adhoc network
조회 수: 4 (최근 30일)
이전 댓글 표시
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
But it does not working properly.
댓글 수: 0
답변 (0개)
참고 항목
제품
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!