Finding Fastest Path with Dijkstra's Algorithm
Fastest path which rescue team should follow in order to reach lost person is found by using Dijkstra's Algorithm.
Rescue team's velocity & vehicle types and elevations of the area are used.
This picture shows an example fastest path.
Hiç yorum yok:
Yorum Gönder