Breadth-first search (graphical) on Ancient Brain
Here is a program doing a graphical version of Breadth-first search.
Each run has a random graph and a random start node and goal node.
(Reload for another one.)
The program uses Breadth-first search
to find a path to the goal.
The graphic display uses
a
Force-directed graph.
Click to run World:
Breadth-first search at
Ancient Brain.
- Credit:
- This is a modified port of
02_bfs_oop_fdg
from AI course
by Daniel Shiffman.
- This is an implementation of an algorithm in
Grokking Algorithms
by Aditya Bhargava.
- Apparently no video.
- Code modified here to generate random graphs with random labels.
- View console to see what is happening.
- All connecting lines are drawn.
Ancient Brain