PROJECT FILM / ZONGO MAQUTU

Dijkstra’s algorithm in a 3D world

Name: Dijkstra’s algorithm in a 3D world
Uploaded: 2026-10-01T11:21:42+02:00
Duration: PT8.17S
Description: Follow a Dijkstra traversal through buildings and trees in a 3D pathfinding visualizer, from the search frontier to the recovered route. Recorded from the current application and played at 2.5× speed. This deterministic graph-search demonstration is separate from the learning replay.

Follow a Dijkstra traversal through buildings and trees in a 3D pathfinding visualizer, from the search frontier to the recovered route.

Fresh capture · Dijkstra traversal in the current application, played at 2.5× speed. · Silent demonstration.

What the film shows

The world contains a start, a goal and obstacles.
Dijkstra’s frontier explores reachable positions.
The application displays the recovered path through the scene.

Behind the demonstration

Recorded from the current application and played at 2.5× speed. This deterministic graph-search demonstration is separate from the learning replay.

Built and documented by Zongo Maqutu. Read the Field Note for the implementation, architecture and limitations.

Read Field Note Launch Project Source