You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
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.
This is a school project from Data Structures and Algorithms course where network flow graph, Dinic's Algorithm are used effectively. It is an application of finding maximum flow on network flow graphs. The aim of the project is make sure to supply as many flow from source to sink.
To analyse the performance of different max-flow/min-cut algorithms like Ford-Fulkerson, Edmonds-Karp, Scaling and Dinic’s on the basis of Binary Image Segmentation
To analyse the performance of different max-flow/min-cut algorithms like Ford-Fulkerson, Edmonds-Karp, Scaling and Dinic’s on the basis of Binary Image Segmentation