With thanks to notagoth.org
The C++ header file "bfs.h" implements the breadth first graph search (route finding) algorithm using
a C++ function template. The interface is written in an STL like style, but the implementation does
not use the STL, or any other "library" code. See also: [ astar ].
Documentation can be found in the comment blocks in the header file.
|
[ View bfs.h in a webpage ]
|
[ Download bfs.h as a text file ]
|
|
Thad's Homepage (c) Wednesday 17th May 2006 T.Frogley With thanks to notagoth.org |
|
| [ source ] |