Giters

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.

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

algorithmsexhaustive-searchgreedy-searchminimum-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.

Course

This project was developed under the Advanced Algorithms course of University of Aveiro.

How to run

You can find the running steps inside the report.pdf file.

Grade

This project's grade was 18 out of 20.

Authors

About

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.

algorithmsexhaustive-searchgreedy-searchminimum-weighted-closure

Languages

Language:TeX 73.1%Language:Python 26.9%