Practical Assignment
Completion requirements
A description of the steiner tree problem is available in the pdf file. Also, the detail about KMB heuristic is already present at the level of the same pdf file.
For the instances on which you can run your algorithms, you can find them in the file "Instances"
The features to be implemented are:
A graphical User interface to visualize the instances (the graphs) and their solutions.
An implementation of KMB heuristic.
The implementation of Kruskal's algorithm as a separated function.
The implementation of Djikstra algorithm also as a separated function.