2 ms·
The algorithm starts at the start nodes, and find all the places it can go from there. It iteratively expands out the search until it reaches the target. I
by Sukotto 15y ago
The algorithm starts at the start nodes, and find all the
places it can go from there. It iteratively expands out the
search until it reaches the target.
I'm not sure I follow. Would you expand a bit on this? Perhaps with a code sample?
- rmc 15y agoI'll upload the code later and explain it a bit more for us techies. This is the 'excutive summary' version./
- loboman 15y agoThe key part is the next sentence: "This is a breath first type search". http://en.wikipedia.org/wiki/Breadth-first_search http://en.wikipedia.org/wiki/Breadth-first_search