bfs := AIBFS new nodes: #( 1 2 3 4); edges: { (1 -> 4) . (1 -> 2) . (2 -> 3) . (3 -> 4)} from: #key to: #value; yourself. shortestPath := bfs runFrom: 1 to: 4
See AIGraphAlgorithm
Breadth-First Searchbfs := AIBFS new nodes: #( 1 2 3 4); edges: { (1 -> 4) . (1 -> 2) . (2 -> 3) . (3 -> 4)} from: #key to: #value; yourself. shortestPath := bfs runFrom: 1 to: 4
See AIGraphAlgorithm