Module Expr Str Assign NameStore Call AttributeLoad Str attr ListLoad Str Assign NameStore ListLoad Str Str Str Str Import alias identifier ImportFrom alias alias FunctionDef arguments args NameParam NameParam NameParam defaults NameLoad body Expr Str If BoolOpAnd NameLoad Call NameLoad NameLoad AttributeLoad NameLoad attr body Assign NameStore AttributeLoad NameLoad attr orelse Assign NameStore AttributeLoad NameLoad attr Assign NameStore Call NameLoad ListLoad NameLoad Assign NameStore Call NameLoad ListLoad TupleLoad NameLoad Call NameLoad NameLoad While NameLoad body Assign TupleStore NameStore NameStore SubscriptLoad NameLoad Index Num TryExcept body Assign NameStore Call NameLoad NameLoad If CompareNotIn NameLoad NameLoad body Expr Yield TupleLoad NameLoad NameLoad Expr Call AttributeLoad NameLoad attr NameLoad Expr Call AttributeLoad NameLoad attr TupleLoad NameLoad Call NameLoad NameLoad handlers ExceptHandler type NameLoad body Expr Call AttributeLoad NameLoad attr decorator_list FunctionDef arguments args NameParam NameParam NameParam defaults NameLoad body Expr Str Assign NameStore Call AttributeLoad NameLoad attr Expr Call AttributeLoad NameLoad attr NameLoad Expr Call AttributeLoad NameLoad attr Call NameLoad NameLoad NameLoad keyword NameLoad Return NameLoad decorator_list FunctionDef arguments args NameParam NameParam defaults body Expr Str Return Call NameLoad GeneratorExp TupleLoad NameLoad NameLoad comprehension TupleStore NameStore NameStore Call NameLoad NameLoad NameLoad decorator_list FunctionDef arguments args NameParam NameParam defaults body Expr Str Assign NameStore Call NameLoad NameLoad For TupleStore NameStore NameStore Call NameLoad NameLoad NameLoad body Expr Call AttributeLoad SubscriptLoad NameLoad Index NameLoad attr NameLoad Return Call NameLoad NameLoad decorator_list
N/A N/A 
====================
Breadth-first search
====================

Basic algorithms for breadth-first searching.
 N/A __author__ N/A N/A join N/A Aric Hagberg <hagberg@lanl.gov> N/A __all__ N/A bfs_edges bfs_tree bfs_predecessors bfs_successors N/A networkx nx collections defaultdict deque bfs_edges N/A N/A G source reverse N/A False N/A N/A Produce edges in a breadth-first-search starting at source. N/A N/A reverse N/A isinstance G N/A nx DiGraph N/A N/A neighbors N/A G predecessors_iter N/A N/A neighbors N/A G neighbors_iter N/A visited N/A set N/A source N/A queue N/A deque N/A N/A source N/A neighbors source N/A queue N/A N/A N/A parent children N/A queue N/A 0 N/A N/A N/A child N/A next children N/A N/A child visited N/A N/A N/A N/A parent child N/A N/A N/A visited add child N/A N/A N/A queue append N/A child N/A neighbors child N/A N/A N/A StopIteration N/A N/A N/A N/A queue popleft N/A bfs_tree N/A N/A G source reverse N/A False N/A N/A Return directed tree of breadth-first-search from source. N/A T N/A N/A nx DiGraph N/A N/A N/A T add_node source N/A N/A N/A T add_edges_from N/A bfs_edges G source reverse reverse N/A T N/A bfs_predecessors N/A N/A G source N/A N/A N/A Return dictionary of predecessors in breadth-first-search from source. N/A N/A dict N/A N/A t s N/A N/A s t N/A bfs_edges G source N/A bfs_successors N/A N/A G source N/A N/A N/A Return dictionary of successors in breadth-first-search from source. N/A d N/A defaultdict list N/A N/A s t N/A bfs_edges G source N/A N/A N/A N/A N/A d N/A s append t N/A N/A dict d N/A