Reverse Breath First Search in C#
Posted
by Ngu Soon Hui
on Stack Overflow
See other posts from Stack Overflow
or by Ngu Soon Hui
Published on 2010-04-05T14:40:30Z
Indexed on
2010/04/05
14:43 UTC
Read the original article
Hit count: 264
Anyone has a ready implementation of the Reverse Breath First Search algorithm in C#?
By Reverse Breath First Search, I mean instead of searching a tree starting from a common node, I want to search the tree from the bottom and gradually converged to a common node.
Let's see the below figure, this is the output of a Breath First Search:
In my reverse breath first search, 9
,10
,11
and 12
will be the first few nodes found ( the order of them are not important as they are all first order). 5
, 6
, 7
and 8
are the second few nodes found, and so on. 1
would be the last node found.
Any ideas or pointers?
© Stack Overflow or respective owner