<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Connected Component on Jeanphilo Blog</title><link>https://shio-chan-dev.github.io/jeanblog/tags/connected-component/</link><description>Recent content in Connected Component on Jeanphilo Blog</description><generator>Hugo -- 0.163.3</generator><language>en-us</language><lastBuildDate>Fri, 29 May 2026 00:00:00 +0800</lastBuildDate><atom:link href="https://shio-chan-dev.github.io/jeanblog/tags/connected-component/index.xml" rel="self" type="application/rss+xml"/><item><title>LeetCode 547: Number of Provinces, Turn an Adjacency Matrix into Connected Components</title><link>https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/547-number-of-provinces/</link><pubDate>Fri, 29 May 2026 00:00:00 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/547-number-of-provinces/</guid><description>Turn LeetCode 547 Number of Provinces from direct connections in an adjacency matrix into connected component counting, then derive DFS, BFS, and Union Find solutions step by step.</description></item></channel></rss>