🛰️ 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 ...

A high-performance library for graph algorithms written in Java. It contains a wide collection of optimized algorithms and data structures for a range of problems on graphs.