The Attacker IP Prioritizer(AIP) dynamically generates resource-friendly IPv4 blocklists from Zeek network flows.
A Python package to quickly decompose weighted graphs (acyclic or not) into weighted paths or walks, under various models.
Python implementation of Mercer Features for Efficient Combinatorial Bayesian Optimization
Energy Grid Optimization and Analysis (EGOA)
This repository contains various implementations of algorithms related to network flows.
Teaching material that I prepared as a TA for the laboratories of the Network Dynamics and Learning course for the MSc in Data Science and Engineering at Politecnico di Torino.
A Python module for generating random network flows problem instances in DIMACS graph format.
Comparative network traffic analysis using public datasets (MAWI and CAIDA) — Undergraduate thesis project (UFSM 2025/1)
Network-flows: a c++ command line tool for network optimization problems
Exact four-terminal planar lower bound and verifiers for cost-preserving unsplittable-flow rounding.
R package for the evaluation of the (weighted, normalised) efficiency of network flows.
LaTeX source code, figures, plots, presentations, and scripts of the PhD thesis "Combinatorial Problems in Energy Networks - Graph-theoretic Models and Algorithms".
A python utility library for geometrical queries on continuous road network spaces. Includes a O(n log n) algorithm (fastest possible) for matching two sets of points placed in a roadmap, using a modified algorithm for minimum cost flows on networks with convex costs on edges.
Code written for lectures and homework in USC CSCI570-Analysis-of-Algorithms Course 🚀🚀🚀
Implementation of maximum flow algorithm from Network flows book by Ahuja, Magnanti, Orlin
Implementation of 2 apps, using Mininet as a Virtual Network Simulator and OpenDaylight Software-Defined-Networking Controller.
Personal Notes on two papers dealing with approximation algorithms for the multicommodity flow problem
A set of presentations and lectures in different fields.
A webapp to visualize the Ford-Fulkerson and Edmonds-Karp max flow algorithms. Below is the link to the website!
NFSTREAM Novelyt Research: Real Time Network Intrusion Detection & Response Tkinter Graphical User Internface
Add a description, image, and links to the network-flows topic page so that developers can more easily learn about it.
To associate your repository with the network-flows topic, visit your repo's landing page and select "manage topics."