search

AlgoGenesis / C

AlgoGenesis is a centralized open-source platform dedicated to providing optimized and well-documented algorithm implementations in C. Perfect for both beginners and advanced users, this repository serves as a comprehensive learning resource for solving algorithmic challenges.
MIT License
38 stars 125 forks source link

Dijkastra’s Shortest Path Algorithm Under Graph Algorithms #498

Open ThunderShadows opened 2 hours ago

ThunderShadows commented 2 hours ago

Name:
[Dijkastra’s Shortest Path Algorithm]

About:
Dijkstra's Shortest Path Algorithm is a popular algorithm used to find the shortest path from a source node to all other nodes in a graph with non-negative edge weights. It works by maintaining a priority queue (min-heap) of nodes based on their current shortest distance from the source. Starting from the source, the algorithm iteratively selects the node with the smallest known distance, updates the distances to its neighbors, and repeats until all nodes are processed. The result is the shortest path from the source to every other node in the graph.

@AlgoGenesis

I want to write a C program for Dijkstra's Algorithm

github-actions[bot] commented 2 hours ago

👋 Thank you for raising an issue! We appreciate your effort in helping us improve. Our team will review it shortly. Stay tuned!

ThunderShadows commented 1 hour ago

@pankaj-bind I would be happy to work on it. Please assign me the issue.