summaryrefslogtreecommitdiff
path: root/networkx/algorithms/traversal/breadth_first_search.py
Commit message (Expand)AuthorAgeFilesLines
* Add unit tests and examples / doctests for nx.descendants_at_distance (#5029)Andrew Eckart2021-08-231-15/+24
* `descendants_at_distance` also for non-DiGraphs (#4952)Michael Dorner2021-07-071-2/+2
* Update docstrings for dfs and bfs edges and fix cross links (#4900)Ross Barnowski2021-06-211-18/+21
* Improves description bfs_predecessors and bfs_successors. (#4438)Matthias Nagel2020-12-101-6/+14
* Format python in docstrings (#4168)Jarrod Millman2020-08-191-3/+3
* Format w/ blackJarrod Millman2020-07-101-8/+18
* add the option of sorting node's neighbors during bfs traversal (#4029)Adnan Abdulmuttaleb2020-07-101-9/+36
* fix typo slightly confusing the meaning (#3840)ernstklrb2020-02-261-2/+2
* Convert %-format to fstringJarrod Millman2020-01-011-1/+1
* Remove boiler plate from top of modulesJarrod Millman2019-11-111-15/+0
* Use yield fromJarrod Millman2019-10-181-3/+1
* Resolve many documentation issues (#3611)Dan Schult2019-09-301-2/+36
* Faster transitive closure computation for DAGs (#3445)Anthony Labarre2019-08-091-1/+45
* Fixed incorrect docs (#3495)Nanda H Krishna2019-06-291-8/+6
* Update copyrightJarrod Millman2019-03-301-1/+1
* Replacing `Return` to `Returns` in docs for functions (#3301)Moradnejad2019-02-181-1/+1
* Depth-limited Breadth First Search (#3077)Mohammed Kashif2018-07-231-21/+79
* Update copyrightJarrod Millman2018-01-201-1/+1
* Update copyrightJarrod Millman2017-07-251-1/+1
* Update docs in traversal. add see also, change produce to iterate over (#2471)Dan Schult2017-06-131-2/+2
* Merge pull request #1874 from jfinkels/prufer-sequenceAric Hagberg2017-01-151-3/+14
|\
| * Adds tree encoding and decoding functions.Jeffrey Finkelstein2016-07-291-3/+14
* | Merge pull request #2129 from jfinkels/beam-searchAric Hagberg2016-07-021-23/+82
|\ \
| * | Adds beam search traversal algorithm with exampleJeffrey Finkelstein2016-05-161-23/+82
| |/
* | replace example in bfs_tree with a correct one (#2160)Heqing Ya2016-06-121-2/+2
|/
* Change all X.add_path yp nx.add_path(X,Dan Schult2016-02-021-8/+4
* Make bfs_successors and bfs_predecessors return iteratorsMridul Seth2015-12-221-16/+36
* Merge pull request #1589 from MridulS/succprediterDan Schult2015-06-171-1/+1
|\
| * Remove successors_iter() and predecessors_iter(). G.successors() and G.predec...Mridul Seth2015-06-121-1/+1
* | Remove neighbors_iter, G.neighbors() now returns an iterator instead of listMridul Seth2015-06-121-1/+1
|/
* Fix #1358: removed claim that source parameter is optional from BFS docstringsArne Neumann2015-02-191-16/+4
* Docstring changes for edge_dfs and company.chebee7i2014-07-191-1/+1
* Add docs for dfs and bfsAric Hagberg2013-12-221-13/+131
* Merge branch 'master' into jni-ancestorschebee7i2013-01-071-8/+5
|\
| * Add isolated nodes to tree in dfs_tree() and bfs_tree().Aric Hagberg2012-10-171-6/+4
* | Improve performance of descendants and ancestorsJuan Nunez-Iglesias2012-11-221-5/+9
* | Rename 'stack' to 'queue' in BFS for clarityJuan Nunez-Iglesias2012-11-131-8/+8
|/
* Fix python2ism in BFS.Aric Hagberg2010-10-181-1/+1
* Update bfs documentation, add tests.Aric Hagberg2010-10-171-2/+2
* Update bfs documentation headingAric Hagberg2010-10-171-2/+2
* Add breadth-first search algorithm and related.Aric Hagberg2010-10-171-0/+52