{"version":"1.0","type":"rich","title":"Prims Algorithm","description":"This animated canvas visualization demonstrates Prim’s algorithm for generating a spanning tree on a 900×600 grid. A web worker computes the maze structure using a minimum-heap priority queue, randomly selecting edges to connect cells. The animation then floods the resulting tree from its root, using D3’s Cubehelix color scale to map hue to Manhattan distance from the root. The canvas rendering updates in timed intervals, creating a smooth color wave that reveals the tree’s structure.","provider_name":"VizHub AI Studio","provider_url":"https://next.vizhub.com","html":"<iframe src=\"https://next.vizhub.com/viz/gist-56c04a26b3e796100a82?mode=embed\" width=\"960\" height=\"500\" scrolling=\"no\" frameborder=\"1\"></iframe>","width":960,"height":500,"cache_age":3600}