<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Bellman-Ford on BLAZED.sh Blog</title>
    <link>https://blazed.sh/blog/tags/bellman-ford/</link>
    <description>Recent content in Bellman-Ford on BLAZED.sh Blog</description>
    <generator>Hugo</generator>
    <language>en-us</language>
    <lastBuildDate>Sun, 22 Jun 2025 10:00:00 +0000</lastBuildDate>
    <atom:link href="https://blazed.sh/blog/tags/bellman-ford/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Arbitrage Basics: Graph Theory for Multi-Pair Arbitrage Detection</title>
      <link>https://blazed.sh/blog/posts/graph_theory_arbitrage/</link>
      <pubDate>Sun, 22 Jun 2025 10:00:00 +0000</pubDate>
      <guid>https://blazed.sh/blog/posts/graph_theory_arbitrage/</guid>
      <description>&lt;h2 id=&#34;welcome-back-to-arbitrage-basics&#34;&gt;Welcome Back to Arbitrage Basics&lt;/h2&gt;&#xA;&lt;p&gt;In our &lt;a href=&#34;https://blazed.sh/blog/posts/tri_arbitrage&#34;&gt;previous post on triangular arbitrage&lt;/a&gt;, we covered 3-pair arbitrage. This time we&amp;rsquo;ll use graph theory to find arbitrage across &lt;strong&gt;any number of trading pairs&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;p&gt;By modeling pairs as a weighted directed graph, we can use Bellman-Ford to detect &lt;strong&gt;negative cycles&lt;/strong&gt;, which correspond directly to profitable arbitrage loops.&lt;/p&gt;&#xA;&lt;h2 id=&#34;why-graph-theory-for-arbitrage&#34;&gt;Why Graph Theory for Arbitrage?&lt;/h2&gt;&#xA;&lt;p&gt;Traditional triangular arbitrage only checks predefined 3-token paths. But what if profitable opportunities exist across 4, 5, or even 10 different tokens? Manual enumeration becomes computationally expensive and misses complex paths.&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
