Describe the project you want to add with tech stack
Dijkstra's algorithm is an algorithm for finding the shortest paths between nodes in a weighted graph.
Tech Stack : C
Expected behavior
A graph and source vertex are requirements for Dijkstra's Algorithm. This Algorithm is established on Greedy Approach and thus finds the locally optimal choice (local minima in this case) at each step of the Algorithm.
Describe the project you want to add with tech stack Dijkstra's algorithm is an algorithm for finding the shortest paths between nodes in a weighted graph. Tech Stack : C
Expected behavior
A graph and source vertex are requirements for Dijkstra's Algorithm. This Algorithm is established on Greedy Approach and thus finds the locally optimal choice (local minima in this case) at each step of the Algorithm.