<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Graph-Theory on Pi Stack</title>
    <link>https://www.pistack.xyz/tags/graph-theory/</link>
    <description>Recent content in Graph-Theory on Pi Stack</description>
    <generator>Hugo</generator>
    <language>en-us</language>
    <lastBuildDate>Sat, 20 Jun 2026 00:00:00 +0000</lastBuildDate>
    <atom:link href="https://www.pistack.xyz/tags/graph-theory/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Self-Hosted Graph Algorithm Libraries: NetworkX vs igraph vs Boost.Graph vs OR-Tools vs OGDF</title>
      <link>https://www.pistack.xyz/posts/2026-06-20-graph-algorithm-libraries-networkx-igraph-boostgraph-ortools-ogdf/</link>
      <pubDate>Sat, 20 Jun 2026 00:00:00 +0000</pubDate>
      <guid>https://www.pistack.xyz/posts/2026-06-20-graph-algorithm-libraries-networkx-igraph-boostgraph-ortools-ogdf/</guid>
      <description>&lt;h2 id=&#34;introduction&#34;&gt;Introduction&lt;/h2&gt;&#xA;&lt;p&gt;Graphs are the universal language of connected systems — social networks, transportation routes, dependency trees, circuit designs, and molecular structures can all be modeled as nodes and edges. Choosing the right graph algorithm library determines not just performance but also what analyses are possible: from finding the shortest path to detecting community structures and solving complex optimization problems.&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
