GitHub

Two C++ programs, one finds the minimum spanning tree of a graph using Prim's Algorithm, and the other finds the shortest path on a graph using Dijkstra's Algorithm.

"In computer science, Prim's (also known as Jarník's) algorithm is a greedy algorithm that finds a minimum spanning tree for a weighted undirected graph. This means it finds a subset of the edges that ...
GitHub

Prim-and-Dijkstra-Algorithms

"In computer science, Prim's (also known as Jarník's) algorithm is a greedy algorithm that finds a minimum spanning tree for a weighted undirected graph. This means it finds a subset of the edges that ...