Skip to content

A Java project that finds max flow of a network, which represents Santa Claus's gift distributing network, by using Dinic's Algorithm

Notifications You must be signed in to change notification settings

Simurgan/Help-the-Santa-Claus-Java-Project

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

2 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Help-the-Santa-Claus-Java-Project

A Java project that finds max flow of a network, which represents Santa Claus's gift distributing network, by using Dinic's Algorithm

CmpE250 Data Structures and Algorithms course project homework 2021 fall semester Bogazici University Computer Engineering Department. This project focuses on max-flow problem. You can check the homework description and test cases for details.

About

A Java project that finds max flow of a network, which represents Santa Claus's gift distributing network, by using Dinic's Algorithm

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages