<?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>Graph Databases on Jeanphilo Blog</title><link>https://shio-chan-dev.github.io/jeanblog/tags/graph-databases/</link><description>Recent content in Graph Databases on Jeanphilo Blog</description><generator>Hugo -- 0.159.2</generator><language>en-us</language><lastBuildDate>Mon, 09 Feb 2026 10:14:45 +0800</lastBuildDate><atom:link href="https://shio-chan-dev.github.io/jeanblog/tags/graph-databases/index.xml" rel="self" type="application/rss+xml"/><item><title>Graph Algorithms Learning Path: From BFS to Graph Computation Models</title><link>https://shio-chan-dev.github.io/jeanblog/dev/algorithm/graph/00-graph-algorithms-learning-path/</link><pubDate>Mon, 09 Feb 2026 10:14:45 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/dev/algorithm/graph/00-graph-algorithms-learning-path/</guid><description>A graph algorithms topic guide and recommended reading order covering BFS/DFS, reachability, shortest paths, CC/SCC, centrality, PageRank, community detection, subgraph matching, dynamic graphs, graph partitioning, and graph computation models.</description></item></channel></rss>