Codes from Graphs final homework
Finds a Maximum Spanning Tree (MST) in a dynamic Graph.
-
Authors:
* Mateus Sousa (UFBA) * Iury Maia (UFBA)
These scripts are our final homework from discipline of Graphs and Algorithms.
We have used a pruning heuristic to remove edges and vertices from a dynamic graph.
We aim to reduce the complexity of the algorithm and create a Stable Distribution Tree by using
the Link Lifetime as edges weight.