<?xml version="1.0" encoding="UTF-8" ?>
<rss version="2.0">
    <channel>
      <title>learning</title>
      <link>https://learning.nucleogenesis.org</link>
      <description>Last 10 notes on learning</description>
      <generator>Quartz -- quartz.jzhao.xyz</generator>
      <item>
    <title>Disjoint-Set-Union</title>
    <link>https://learning.nucleogenesis.org/Learning/DSA/Disjoint-Set-Union</link>
    <guid>https://learning.nucleogenesis.org/Learning/DSA/Disjoint-Set-Union</guid>
    <description><![CDATA[ Disjoint-Set-Union (Union-Find) Convention: Answer blocks are children of “Show answer” parents. Click the triangle to collapse — Logseq remembers. ]]></description>
    <pubDate>Fri, 15 May 2026 08:19:35 GMT</pubDate>
  </item><item>
    <title>Connectivity</title>
    <link>https://learning.nucleogenesis.org/Learning/DSA/Graphs/Connectivity</link>
    <guid>https://learning.nucleogenesis.org/Learning/DSA/Graphs/Connectivity</guid>
    <description><![CDATA[ Connectivity — components, cycles, bipartite Convention: Answer blocks are children of “Show answer” parents. ]]></description>
    <pubDate>Fri, 15 May 2026 08:19:35 GMT</pubDate>
  </item><item>
    <title>MST</title>
    <link>https://learning.nucleogenesis.org/Learning/DSA/Graphs/MST</link>
    <guid>https://learning.nucleogenesis.org/Learning/DSA/Graphs/MST</guid>
    <description><![CDATA[ Minimum spanning tree — Kruskal and Prim Convention: Answer blocks are children of “Show answer” parents. ]]></description>
    <pubDate>Fri, 15 May 2026 08:19:35 GMT</pubDate>
  </item><item>
    <title>SCC</title>
    <link>https://learning.nucleogenesis.org/Learning/DSA/Graphs/SCC</link>
    <guid>https://learning.nucleogenesis.org/Learning/DSA/Graphs/SCC</guid>
    <description><![CDATA[ Strongly connected components, bridges, articulation points Convention: Answer blocks are children of “Show answer” parents. ]]></description>
    <pubDate>Fri, 15 May 2026 08:19:35 GMT</pubDate>
  </item><item>
    <title>Shortest-Paths</title>
    <link>https://learning.nucleogenesis.org/Learning/DSA/Graphs/Shortest-Paths</link>
    <guid>https://learning.nucleogenesis.org/Learning/DSA/Graphs/Shortest-Paths</guid>
    <description><![CDATA[ Shortest paths — BFS, Dijkstra, Bellman-Ford, Floyd-Warshall Convention: Answer blocks are children of “Show answer” parents. ]]></description>
    <pubDate>Fri, 15 May 2026 08:19:35 GMT</pubDate>
  </item><item>
    <title>Topological-Sort</title>
    <link>https://learning.nucleogenesis.org/Learning/DSA/Graphs/Topological-Sort</link>
    <guid>https://learning.nucleogenesis.org/Learning/DSA/Graphs/Topological-Sort</guid>
    <description><![CDATA[ Topological sort — ordering a DAG Convention: Answer blocks are children of “Show answer” parents. Click the triangle to collapse — Logseq remembers. ]]></description>
    <pubDate>Fri, 15 May 2026 08:19:35 GMT</pubDate>
  </item><item>
    <title>Priority-Queue</title>
    <link>https://learning.nucleogenesis.org/Learning/DSA/Priority-Queue</link>
    <guid>https://learning.nucleogenesis.org/Learning/DSA/Priority-Queue</guid>
    <description><![CDATA[ Priority queue (binary heap) Convention: Answer blocks are children of “Show answer” parents. Click the triangle to collapse — Logseq remembers. ]]></description>
    <pubDate>Fri, 15 May 2026 08:19:35 GMT</pubDate>
  </item><item>
    <title>Graphs</title>
    <link>https://learning.nucleogenesis.org/Learning/DSA/Graphs/</link>
    <guid>https://learning.nucleogenesis.org/Learning/DSA/Graphs/</guid>
    <description><![CDATA[ Graphs — topic hub A graph is a set of vertices V and edges E ⊆ V × V. ]]></description>
    <pubDate>Fri, 15 May 2026 07:01:47 GMT</pubDate>
  </item><item>
    <title>DSA</title>
    <link>https://learning.nucleogenesis.org/Learning/DSA/</link>
    <guid>https://learning.nucleogenesis.org/Learning/DSA/</guid>
    <description><![CDATA[ Learning/DSA Personal study hub for Data Structures &amp; Algorithms. ]]></description>
    <pubDate>Fri, 15 May 2026 07:01:47 GMT</pubDate>
  </item><item>
    <title>Basics</title>
    <link>https://learning.nucleogenesis.org/Learning/DSA/Graphs/Basics</link>
    <guid>https://learning.nucleogenesis.org/Learning/DSA/Graphs/Basics</guid>
    <description><![CDATA[ Graphs — basics &amp; representations Convention on this page: Answer blocks live as children of a parent “Show answer” bullet. ]]></description>
    <pubDate>Fri, 15 May 2026 06:22:53 GMT</pubDate>
  </item>
    </channel>
  </rss>