Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
nikanj
5 months ago
|
parent
|
context
|
favorite
| on:
Solving the minimum cut problem for undirected gra...
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"
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: