Search Class
============

>>> from networkx import *
>>> from networkx.queues import *
>>> from networkx.search_class import *
>>> from networkx.generators.classic import *
>>> G=grid_2d_graph(4,4)

>>> V=Preorder(G)
>>> V.search(v=1)
>>> print V.forest
[[1, 2, 5, 6, 9, 10, 13, 14, 15, 16, 11, 12, 7, 8, 3, 4]]

>>> V=Postorder(G)
>>> V.search(v=1)
>>> print V.forest
[[1, 5, 9, 13, 14, 15, 11, 7, 6, 10, 2, 3, 4, 8, 12, 16]]

>>> V=Successor(G)
>>> V.search(v=1)
>>> print sorted(V.data[1])
[5]

>>> V=Predecessor(G)
>>> V.search(v=1)
>>> print sorted(V.data[6])
[7]

>>> V=Forest(G,queue=BFS)
>>> V.search(v=1)
>>> G=V.forest[0]
>>> print sorted(G.nodes())
[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16]

>>> V=Length(G,queue=BFS)
>>> V.search(v=1)
>>> print V.length[16]
6

>>> V=Search(G,queue=BFS)
>>> V.search(v=1)

