Graphs_ufba

Codes from Graphs final homework

Finds a Maximum Spanning Tree (MST) in a dynamic Graph.

Authors:

  * Mateus Sousa (UFBA)

  * Iury Maia (UFBA)

Description

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.

Name		Name	Last commit message	Last commit date
Latest commit History 75 Commits
graphs2.0		graphs2.0
graphs3.0		graphs3.0
.gitignore		.gitignore
README.md		README.md
mQueue.py		mQueue.py
maximal_clique.py		maximal_clique.py
maximal_pruning_clique.py		maximal_pruning_clique.py