This is the implementation of dijkstra algorithm for ground robots. This is our implementation of Project 2 as part of the course ENPM661 to understand how the dijkstra algorithm works and visualize it using OpenCV. Dependencies This code was tested with the following dependencies: Python 3 Opencv...
Psuedo Code for Dijkstra’s Algorithm Method DIJKSTRA(G, SV) G-> graph; SV->starting vertex; begin for every vertex VX in G //initialization; set the initial path to infinite and current node to 0 or null; Distance[VX] <- infinite Current[VX] <- NULL If V != SV, add VX to P...
In Dijkstra’s algorithm, we maintain two sets or lists. One contains the vertices that are a part of the shortest-path tree (SPT) and the other contains vertices that are being evaluated to be included in SPT. Hence for every iteration, we find a vertex from the second list that has ...