As a challenge I thought I’d try to implement the Minimum Spanning Tree algorithm, and have a play with it. My code is based off the excellent Coding Train video on the same topic which you can watch here. It’s where I got the code from, and then mixed in some code from the Arrays of Objects video too.
The result is a rather pleasing moving sea of dots that will join up when they’re close to each other.
Previous Entry
A week of Pico 8, and the fun of limits
Next Entry
#GitHubGameOff Jam 2019 Day 1
Advertisement
Latest Entries
Shadertoy 3 Raymarching
10294 views
Shadertoy 2 Sinewaves
11150 views
Shadertoy 1 - Mandelbrot
1166 views
Writing C Code on a Spectrum Next
8967 views
Gameboy Advance Dev Workflow in 2020
7277 views
#GitHubGameOff Jam 2019 Day 1
4082 views
Minimum Spanning Tree
1197 views
Advertisement