<?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>Bfs on Rafiul Alam</title>
    <link>https://alamrafiul.com/tags/bfs/</link>
    <description>Recent content in Bfs on Rafiul Alam</description>
    <image>
      <title>Rafiul Alam</title>
      <url>https://alamrafiul.com/papermod-cover.png</url>
      <link>https://alamrafiul.com/papermod-cover.png</link>
    </image>
    <generator>Hugo -- gohugo.io</generator>
    <language>en</language>
    <lastBuildDate>Sun, 16 Nov 2025 00:00:00 +0000</lastBuildDate><atom:link href="https://alamrafiul.com/tags/bfs/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Complete Guide to Graph Algorithms in Go</title>
      <link>https://alamrafiul.com/posts/go-graph-algorithms/</link>
      <pubDate>Sun, 16 Nov 2025 00:00:00 +0000</pubDate>
      
      <guid>https://alamrafiul.com/posts/go-graph-algorithms/</guid>
      <description>Master graph algorithms in Go with complete implementations, complexity analysis, and practical use cases. Covers BFS, DFS, Dijkstra&amp;#39;s, Bellman-Ford, Floyd-Warshall, Kruskal&amp;#39;s, Prim&amp;#39;s, topological sort, and more.</description>
    </item>
    
    <item>
      <title>Matrix as Graph: A Mental Model for Solving 2D Array Problems</title>
      <link>https://alamrafiul.com/blogs/matrix-as-graph-thinking/</link>
      <pubDate>Sun, 15 Sep 2024 00:00:00 +0000</pubDate>
      
      <guid>https://alamrafiul.com/blogs/matrix-as-graph-thinking/</guid>
      <description>&lt;h2 id=&#34;the-aha-moment-every-cell-is-a-node&#34;&gt;The Aha Moment: Every Cell Is a Node&lt;/h2&gt;
&lt;p&gt;If you&amp;rsquo;ve ever felt stuck staring at a grid problem, unsure where to start, you&amp;rsquo;re not alone. The breakthrough comes when you realize: &lt;strong&gt;a matrix is just a graph in disguise&lt;/strong&gt;.&lt;/p&gt;
&lt;p&gt;Each cell in a 2D array is a node. The connections between adjacent cells (up, down, left, right, and sometimes diagonals) are the edges. Once this clicks, an entire category of problems becomes approachable using familiar graph algorithms.&lt;/p&gt;</description>
    </item>
    
  </channel>
</rss>
