Re:Solving the minimum cut problem for undirected graphs
by ryandv on Wednesday April 17, 2024 @02:29PM
(#40068447)
Elegant. For whatever reason I elected to roll my own graph implementation in my own solution, with predictably terrible performance characteristics: using adjacency lists (instead of matrices) and BTreeSets to model "merged" vertices was not the greatest idea in hindsight..
At least it spit out the right answer after a while.
At least it spit out the right answer after a while.