dgleich / find_densest_subgraph

Find the densest subgraph in an undirected graph through Andrew Goldberg's algorithm and based on Dan Spielman's Dinic Maxflow code

Geek Repo

Github PK Tool