Dijkastra Algorithm in vehicular adhoc network

1 view (last 30 days)
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.

Answers (0)

Categories

Tags

Products

Community Treasure Hunt

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

Start Hunting!

Translated by