https://github.com/simonskodt/aldes-flow-behind-enemy-lines

Mandatory assignment in Algorithm Design using Flow Networks
https://github.com/simonskodt/aldes-flow-behind-enemy-lines

ford-fulkerson network-flow

Last synced: 6 days ago
JSON representation

Mandatory assignment in Algorithm Design using Flow Networks

• Host: GitHub
• URL: https://github.com/simonskodt/aldes-flow-behind-enemy-lines
• Owner: simonskodt
• License: mit
• Created: 2023-10-11T07:20:38.000Z (over 2 years ago)
• Default Branch: main
• Last Pushed: 2023-11-15T19:45:53.000Z (over 2 years ago)
• Last Synced: 2025-01-04T11:12:09.246Z (over 1 year ago)
• Topics: ford-fulkerson, network-flow
• Language: Python
• Homepage:
• Size: 437 KB
• Stars: 1
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

          
# Flow Behind Enemy Lines

Mandatory assignment in Algorithm Design using Flow Networks.

## Task

To find the maximum flow and corresponding minimum cut in a flow network, 

describing the railway system of the Eastern Bloc during the Cold War.

## Motivation

> We’re behind on the five year plan! The party secretary from Minsk has been 

tasked with reducing the capacity of one or two railway lines by 10 or 20 

kilotons per day. Luckily, you have acquired data about the full Soviet railway 

system from an American double agent.

## Input and Output

From the input-file `data/rail.txt`, we must run the Ford-Fulkerson algorithm 

to achieve the output provided in the `data/result.txt`.