News for hackers. Stuff that matters.
Re:Solving the minimum cut problem for undirected graphs by nikanj on Wednesday April 17, 2024 @08:26PM (#40071662)
I visualized the AoC graph with graphviz and identified the minimum cut using good ol' mark 1 eyeball. Humans have an incredibly efficient algorithm for identifying "this blob is only connected to that blob with these two lines"

There are no comments on this comment yet.