maxflow

A collection of algorithms and data structures

Flow algorithms on Graphs.jl

Robust implementation of Ford-Fulkerson algorithm and use case in Airline Scheduling

Maxflow Ford-Fulkerson Algorithm using BFS. It is a method to Solve the Maximum Flow Problem in a Flow Network by Finding Augmenting Paths from the Source to the Sink Iteratively and Increasing the Flow along these Paths.

A Python implementation of the Max-Flow (Edmonds-Karp) algorithm adapted to solve problems with both edge and vertex (node) capacities.

An implementation of Ford-Fulkerson variants (Edmonds-Karp, Randomized DFS, Fattest Path) designed to evaluate their performance across multiple DIMACS graph instances.

Useful data structures and algorithms mostly related to Graphs.

This repository contains all home and lab assignments for the CSE 208: Data Structures and Algorithms II Sessional course, part of our Term-2, Level-2 curriculum. It applies theories from CSE 207 to problem-solving and creating data structures.

A collection of algorithms and data structures

A Water Supply Manager that uses the greedy algorithmic approach in the context of max-flow problems

Code for the paper: Densest Subhypergraph: Negative Supermodular Functions and Strongly Localized Methods

nxtgm -- a C++/Python/JavaScript library for discrete graphical models writen in C++17

Small video game in which you have to guess the maxflow in a graph

A Julia Implementation of the Highest Label Preflow Push Variant of Push and Relabel Algorithm

Package provides javascript implementation of algorithms for graph processing

A collection of algorithms and data structures

L.EIC 2ⁿᵈ year/ 2ⁿᵈ semester

Algoritmos de Grafos: Flujo Mínimo, Floyd-Warshall, Ruta Crítica(CPM, PERT), Dijkstra, Kruskal y aceleración de proyectos