<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Disjoint Set on Rik Kisnah - Blog</title><link>https://www.rik-kisnah.ai/tags/disjoint-set/</link><description>Recent content in Disjoint Set on Rik Kisnah - Blog</description><generator>Hugo</generator><language>en</language><lastBuildDate>Tue, 20 Jan 2026 09:00:00 -0800</lastBuildDate><atom:link href="https://www.rik-kisnah.ai/tags/disjoint-set/feed.xml" rel="self" type="application/rss+xml"/><item><title>Connected Components with Union-Find</title><link>https://www.rik-kisnah.ai/teach/coding/connected-components-union-find/</link><pubDate>Tue, 20 Jan 2026 09:00:00 -0800</pubDate><guid>https://www.rik-kisnah.ai/teach/coding/connected-components-union-find/</guid><description>Given a list of friendships, how many separate friend groups are there? Everyone starts as their own group. Each friendship merges two groups. A tiny structure with two operations answers it almost instantly, and it is what real systems use to track which servers are in which cluster.</description></item></channel></rss>