This repository contains my solution for finding maximal flow between two point in the graph. This repo was created as a solution of my assignment in university course on Programming in C.
I have used Dinics algorithm to solve this problem.
samlkrystof/Network_Flow
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|