blog

Personal blog
git clone git://git.laack.co/blog.git
Log | Files | Refs

commit a893f3f3a657f34aceeccde22669b10610a10c09
parent 00e40bbb192c88c009b189d265e3b69018fa004d
Author: Andrew Laack <andrew@laack.co>
Date:   Tue,  6 Oct 2026 21:28:51 -0500

Revert

Co-authored-by: Vim

Diffstat:
Mposts/entries/pygame-vs-raylib.md | 2+-
Mposts/gemini/feed.xml | 7++-----
Mposts/site/feed.xml | 7++-----
Mposts/site/pygame-vs-raylib.html | 5+----
4 files changed, 6 insertions(+), 15 deletions(-)

diff --git a/posts/entries/pygame-vs-raylib.md b/posts/entries/pygame-vs-raylib.md @@ -4,7 +4,7 @@ I implemented [Prim's algorithm](https://cp-algorithms.com/graph/mst_prim.html) to create a MST of a graph in Python. I also created a visualization of it, shown below. -![Prim's algorithm visualization](videos/prim.mkv) +![](videos/prim.mkv) (This graph has 250 vertices and 1,000 edges. The source code used to generate this visualization can be found [here](https://git.laack.co/blog/file/python/pygame-vs-raylib/prim.py.html)) diff --git a/posts/gemini/feed.xml b/posts/gemini/feed.xml @@ -7,16 +7,13 @@ <language>en-us</language> <managingEditor>andrew@laack.co</managingEditor> <webMaster>andrew@laack.co</webMaster> -<lastBuildDate>Tue, 06 Oct 2026 21:25:54 -0500</lastBuildDate> +<lastBuildDate>Tue, 06 Oct 2026 21:28:45 -0500</lastBuildDate> <atom:link href="gemini://blog.laack.co/feed.xml" rel="self" type="application/rss+xml"/> <item> <title><![CDATA[PyGame vs. Raylib]]></title> <link>gemini://blog.laack.co/pygame-vs-raylib.gmi</link> <description><![CDATA[<p>I implemented <a href="https://cp-algorithms.com/graph/mst_prim.gmi">Prim’s algorithm</a> to create a MST of a graph in Python. I also created a visualization of it, shown below.</p> -<figure> -<video src="videos/prim.mkv" controls=""><a href="videos/prim.mkv">Prim’s algorithm visualization</a></video> -<figcaption aria-hidden="true">Prim’s algorithm visualization</figcaption> -</figure> +<p><video src="videos/prim.mkv" controls=""><a href="videos/prim.mkv">Video</a></video></p> <p>(This graph has 250 vertices and 1,000 edges. The source code used to generate this visualization can be found <a href="https://git.laack.co/blog/file/python/pygame-vs-raylib/prim.py.gmi">here</a>)</p> <p>Prim’s algorithm is worth understanding (albeit out of scope), and the problem it solves is finding the set of edges that minimizes the sum of their weights while guaranteeing there is exactly one path between any two vertices in the connected, weighted, undirected graph. In the case of my implementation, the weight of each edge was its length.</p> <p>As it relates to the animation, the following two things should be apparent:</p> diff --git a/posts/site/feed.xml b/posts/site/feed.xml @@ -7,16 +7,13 @@ <language>en-us</language> <managingEditor>andrew@laack.co</managingEditor> <webMaster>andrew@laack.co</webMaster> -<lastBuildDate>Tue, 06 Oct 2026 21:25:54 -0500</lastBuildDate> +<lastBuildDate>Tue, 06 Oct 2026 21:28:45 -0500</lastBuildDate> <atom:link href="https://blog.laack.co/feed.xml" rel="self" type="application/rss+xml"/> <item> <title><![CDATA[PyGame vs. Raylib]]></title> <link>https://blog.laack.co/pygame-vs-raylib.html</link> <description><![CDATA[<p>I implemented <a href="https://cp-algorithms.com/graph/mst_prim.html">Prim’s algorithm</a> to create a MST of a graph in Python. I also created a visualization of it, shown below.</p> -<figure> -<video src="videos/prim.mkv" controls=""><a href="videos/prim.mkv">Prim’s algorithm visualization</a></video> -<figcaption aria-hidden="true">Prim’s algorithm visualization</figcaption> -</figure> +<p><video src="videos/prim.mkv" controls=""><a href="videos/prim.mkv">Video</a></video></p> <p>(This graph has 250 vertices and 1,000 edges. The source code used to generate this visualization can be found <a href="https://git.laack.co/blog/file/python/pygame-vs-raylib/prim.py.html">here</a>)</p> <p>Prim’s algorithm is worth understanding (albeit out of scope), and the problem it solves is finding the set of edges that minimizes the sum of their weights while guaranteeing there is exactly one path between any two vertices in the connected, weighted, undirected graph. In the case of my implementation, the weight of each edge was its length.</p> <p>As it relates to the animation, the following two things should be apparent:</p> diff --git a/posts/site/pygame-vs-raylib.html b/posts/site/pygame-vs-raylib.html @@ -102,10 +102,7 @@ <h1 id="pygame-vs.-raylib">PyGame vs. Raylib</h1> <h2 id="date-20260920">Date: 2026/09/20</h2> <p>I implemented <a href="https://cp-algorithms.com/graph/mst_prim.html">Prim’s algorithm</a> to create a MST of a graph in Python. I also created a visualization of it, shown below.</p> -<figure> -<video src="videos/prim.mkv" controls=""><a href="videos/prim.mkv">Prim’s algorithm visualization</a></video> -<figcaption aria-hidden="true">Prim’s algorithm visualization</figcaption> -</figure> +<p><video src="videos/prim.mkv" controls=""><a href="videos/prim.mkv">Video</a></video></p> <p>(This graph has 250 vertices and 1,000 edges. The source code used to generate this visualization can be found <a href="https://git.laack.co/blog/file/python/pygame-vs-raylib/prim.py.html">here</a>)</p> <p>Prim’s algorithm is worth understanding (albeit out of scope), and the problem it solves is finding the set of edges that minimizes the sum of their weights while guaranteeing there is exactly one path between any two vertices in the connected, weighted, undirected graph. In the case of my implementation, the weight of each edge was its length.</p> <p>As it relates to the animation, the following two things should be apparent:</p>