Network Flow: Given a directed graph with edge capacities and vertex demands, is there a circulation of flow?

Network Flows Optimization: Shortest path problems algorithms - Maximum flow problems algorithms - Minimum cost flow problem algorithms

Goal of this academic project is to implement the Breadth First Search, Ford-Fulkerson Network flow algorithm and use it to solve the Circulation with Demands problem.

In this project gifts are distributed via different vehicles which difference sizes. This project actually models the implementation of a network flow. The program tries to find a solution to distribute all the gifts without excessing vehicle capacities based on Ford-Fulkerson's max flow algorithm.

All of my original scripts written for Computer Science 2

Algorithms and Data Structures a comprehensive collection of fundamental Algorithms and Data structures organized into various categories to cater to the needs of software engineers and computer science students.

Exploring different methods & algorithms, practicing fundamental techniques and terms of algorithm design domain

Assignment solutions for Csc 226 (Alogrithms and Data Structures 2) at UVIC