Final project of the Algorithms and Data Structures course at Politecnico di Milano.
The goal was to impelement an efficient (tested with time and memory benchmarks) algorithm to extract the top-K nodes from a weighted directed graph.
Language: C
Final project of the Algorithms and Data Structures course at Politecnico di Milano.
The goal was to impelement an efficient (tested with time and memory benchmarks) algorithm to extract the top-K nodes from a weighted directed graph.
Language: C