C Program to find a minimum spanning tree using Prim’s algorithm

Posted on October 20, 2011June 19, 2026 by Sandeepa Nadahalli

Prim’s algorithm is a greedy algorithm that finds a Minimum Spanning Tree (MST) for a weighted, connected, undirected graph. A spanning tree connects all the vertices of a graph with no cycles; the minimum spanning tree is the one whose total edge weight is the smallest possible. Prim’s builds this tree one vertex at a …

C Program to implement Dijkstra’s algorithm.

Posted on October 19, 2011 by Sandeepa Nadahalli

C Program to implement Dijkstra’s algorithm. Dijkstra’s Algorithm finds the shortest path with the lower cost in a Graph. Dijkstra’s Algorithm solves the Single Source Shortest Path problem for a Graph. It is a Greedy algorithm and similar to Prim’s algorithm. Read more about C Programming Language . /************************************************************ You can use all the programs …