Minimum-Spanning-Tree Experiment - Implement Prim's Algorithm

virtual-labs-archive / data-structures-iiith

This repository contains sources to Data Structures Lab IIITH.

https://cse01-iiith.vlabs.ac.in/

Other

1 stars 73 forks source link

Open AnimeshSinha1309 opened 5 years ago

AnimeshSinha1309 commented 5 years ago

Current implementation of the lab only has Kruskal's Maximum Spanning Subtree Algorithm.

Both Kruskal's and Prim's Algorithms should be offered as choices to the user.
The Data Structures storing the order of Nodes in the Process Queue should also be displayed.
Algorithm's Code being executed should preferably be on the screen.

error-2