Graphical Implementation For Prim's Algorithm

Project in brief:

It's a graphical implementation for prim's algorithm, that is know as greedy algorithm.

The project take from the user the nodes andthe links in a simple way, and calculates the shortest route betweenall the nodes,then draws the output in a nice fashion.

How the algorithm works:

The algorithm works by starting from a randomnode and checks the minimum cost for all links for it, then goes to thesecond node and then checks again for the least cost for the two nodes,considering not to visit any visited node.

Download algorithmass.zip