eduardosantoshf/minimum-weighted-closure 📦

AA First Assignment - 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.

Language: TeX - Size: 1.35 MB - Last synced at: 5 days ago - Pushed at: over 2 years ago - Stars: 0 - Forks: 0