<?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>Transitive Closure on Jeanphilo Blog</title><link>https://shio-chan-dev.github.io/jeanblog/tags/transitive-closure/</link><description>Recent content in Transitive Closure on Jeanphilo Blog</description><generator>Hugo -- 0.159.2</generator><language>en-us</language><lastBuildDate>Mon, 09 Feb 2026 09:52:17 +0800</lastBuildDate><atom:link href="https://shio-chan-dev.github.io/jeanblog/tags/transitive-closure/index.xml" rel="self" type="application/rss+xml"/><item><title>k-hop and Reachability Queries: BFS Limits, Reachability Indexes, and 2-hop Labeling ACERS Analysis</title><link>https://shio-chan-dev.github.io/jeanblog/dev/algorithm/graph/30-k-hop-reachability-and-reach-index/</link><pubDate>Mon, 09 Feb 2026 09:52:17 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/dev/algorithm/graph/30-k-hop-reachability-and-reach-index/</guid><description>A systematic engineering guide to k-hop and reachability queries: BFS+hop limits, why full transitive closure is usually not maintained, and practical bitmap/2-hop reach-index strategies with runnable multi-language code.</description></item></channel></rss>