The objective of this project was to find a minimum weighted closure for a given vertex-weighted directed graph G(V, E), with n vertices and m edges. Exhaustive Search and Greedy Algorithms were used to solve this problem, and both approaches were compared in terms of execution time, as well as time complexity.
This project was developed under the Advanced Algorithms course of University of Aveiro.
You can find the running steps inside the report.pdf file.
This project's grade was 18 out of 20.
- Eduardo Santos: eduardosantoshf