Implementation of the maximum network flow problem in CUDA.

Algorithm project solving a maximum flow problem

My implementation of Ford–Fulkerson algorithm to solve the famous Max-Flow Problem

Capacity scaling to solve the maximum flow problem

Graph & Network Algorithms.

PUBLIC | Faculdade de Ciências e Tecnologia da Universidade de Coimbra (FCTUC) - Mestrado em Engenharia Informática (MEI) - Percurso: Engenharia de Software - 2022/2023 | Metodologias Experimentais em Informática (MEI) - Projeto: design the experiment to investigate the runtime performance of these three algorithms in practice.

Find maximum possible flow in your graphs, optimize networks.

This project solves the maxflow problem in algorithmics from an instance in the instances directory, The problem is solved using GLPK and the augmenting path DInitz algorithm