🛰️ An interactive visual simulator that models internet packet flow across a custom network using max-flow algorithms. It helps analyze routing efficiency using Dinic, Edmonds-Karp, Goldberg-Tarjan, Boykov-Kolmogorov and MCMF algorithms in real-time.
hacktoberfest daa mcmf dinic-algorithm design-and-analysis-of-algorithms edmonds-karp goldberg-tarjan internet-packet-simulator
- Updated
Jun 25, 2025 - C++