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.