Uploaded August 2015 | Updated November 2026, 2 hours ago
I decided to push the limits of minimum spanning tree algorithms some more. Like the hybrid algorithm in my previous video, it's still a mix of Prim's and Kruskal's algorithms. This time I implemented the separate mergeable priority queues I alluded to in the description, so all trees get to grow more evenly. I also made it a hybrid passage carver and wall adder. The visualization now has foresight: it recognizes when an edge can only become a passage or a wall.
The previous video showing plain Prim and Kruskal as well as a less crazy hybrid: youtube.com/watch?v=MXqvIaZJBXo
I decided to push the limits of minimum spanning tree algorithms some more. Like the hybrid algorithm in my previous video, it's still a mix of Prim's and Kruskal's algorithms. This time I implemented the separate mergeable priority queues I alluded to in the description, so all trees get to grow more evenly. I also made it a hybrid passage carver and wall adder. The visualization now has foresight: it recognizes when an edge can only become a passage or a wall.
The previous video showing plain Prim and Kruskal as well as a less crazy hybrid: youtube.com/watch?v=MXqvIaZJBXo










