Prim’s Algorithm in C – Minimum Spanning Tree (MST)

Posted on October 20, 2011July 12, 2026 by Sandeepa Nadahalli

Prim’s algorithm finds the Minimum Spanning Tree (MST) of a weighted undirected graph — the set of edges that connects all vertices at the lowest possible total cost. It works by growing a single tree: start at any vertex, then repeatedly add the cheapest edge that reaches a vertex not yet in the tree, until …

Dijkstra’s Algorithm in C – Shortest Path with Step-by-Step Trace

Posted on October 19, 2011July 12, 2026 by Sandeepa Nadahalli

Dijkstra’s algorithm finds the shortest path from one source vertex to all other vertices in a weighted graph with non-negative edge weights. It is a greedy algorithm: at each step it picks the unvisited vertex with the smallest known distance, marks it done, and relaxes its neighbours — updating any neighbour’s distance if a shorter …