emmanuj/netgen
A library for generating network flow graph problems
Public GitHub Catalog
Discovered Oct 14, 2026
emmanuj / dinic_max_flow
An Implementation of Dinic's maximum network flow algorithm
About this discovery
Public repository record indexed from GitHub. Explore verified star velocity metrics, source code repositories, and curated developer tool directories across the GitHubRepo ecosystem.
#38556471GitHub System ID
emmanujOrganization / User
PublicVisibility
ActiveCatalog Status
More from emmanuj
emmanuj/dials_shortest_path
An implementation of Dial's shortest path algorithm
emmanuj/cpp-optparse
Python's excellent OptionParser in C++
emmanuj/mst-solver
Minimum Spanning tree solver. Implemented based Kruskal's algorithm using a d-heap as a priority queue of edges and rooted trees for disjoint sets.