Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
shepherdjerred
56 days ago
|
parent
|
context
|
favorite
| on:
Possibly all the ways to get loop-finding in graph...
Disjoint sets are awesome! You can use them with a _very_ simple algorithm to form a minimum spanning tree.
https://en.wikipedia.org/wiki/Kruskal%27s_algorithm
Consider applying for YC's W25 batch! Applications are open till Nov 12.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
https://en.wikipedia.org/wiki/Kruskal%27s_algorithm