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.
-
Notifications
You must be signed in to change notification settings - Fork 0
samlkrystof/Network_Flow
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published