summaryrefslogtreecommitdiff
path: root/networkx/algorithms/traversal
Commit message (Expand)AuthorAgeFilesLines
* PEP8 changes for networkx/algorithms/traversal/tests/test_bfs.pyMridul Seth2015-06-071-15/+16
* Add bfs test for directed graph in reverse directionMridul Seth2015-06-071-0/+6
* Fix #1358: removed claim that source parameter is optional from BFS docstringsArne Neumann2015-02-191-16/+4
* Improve memory footprint of edge_dfs.chebee7i2014-07-201-7/+4
* Docstring.chebee7i2014-07-191-1/+1
* Fix bug for reverse edge DFS.chebee7i2014-07-192-9/+47
* Docstring changes for edge_dfs and company.chebee7i2014-07-193-17/+26
* Use import * in traversal submodule.chebee7i2014-07-191-1/+1
* Remove enum import statement.chebee7i2014-07-161-1/+0
* Use 'forward' and 'reverse' strings to indicate traversal direction.chebee7i2014-07-163-46/+26
* Violating 80 character rule to make doctests happy.chebee7i2014-07-101-9/+2
* Add option for 'reverse' traversals.chebee7i2014-07-102-14/+40
* Make edge_dfs use a new Direction enum.chebee7i2014-07-103-10/+43
* Fix doctest again.chebee7i2014-06-111-6/+6
* Add import statement for doctest.chebee7i2014-06-111-0/+1
* Add some additional comments.chebee7i2014-06-111-0/+3
* Add DFS over edges.chebee7i2014-06-113-4/+223
* Add docs for dfs and bfsAric Hagberg2013-12-222-39/+346
* Merge branch 'master' into jni-ancestorschebee7i2013-01-074-17/+34
|\
| * Add isolated nodes to tree in dfs_tree() and bfs_tree().Aric Hagberg2012-10-174-15/+33
* | 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
|/
* Even more imports cleanup and exceptions fixed.Loïc Séguin-C.2011-02-101-1/+0
* Fix python2ism in BFS.Aric Hagberg2010-10-181-1/+1
* Add tests for dfs source=NoneAric Hagberg2010-10-181-1/+16
* Allow source=None option in depth-first search.Aric Hagberg2010-10-181-56/+72
* Add dfs_forrest.Aric Hagberg2010-10-171-1/+11
* Update bfs documentation, add tests.Aric Hagberg2010-10-172-2/+31
* Test dfs_labeled_edges. Addresses #418Aric Hagberg2010-10-171-0/+5
* Test dfs_edges. Addresses #418Aric Hagberg2010-10-171-0/+4
* Bugfix in dfs postorder. Adjust tests for new interface.Aric Hagberg2010-10-172-11/+13
* Update bfs documentation headingAric Hagberg2010-10-171-2/+2
* Add breadth-first search algorithm and related.Aric Hagberg2010-10-172-0/+54
* New depth-first search iterators and graphs.Aric Hagberg2010-10-171-169/+81
* Switch tests to unittest stylearic2010-08-102-30/+32
* Merging py3k-1.2 branch into trunk. Addresses #348loicseguin2010-08-021-2/+2
* Update dfs docsaric2010-04-051-3/+0
* Update importsaric2010-03-241-0/+1
* Move and rename tests.aric2010-03-242-246/+0
* Move shortest path algorithms to new directory. Rename search.py.aric2010-03-246-1409/+1
* Remove components from import in traversalaric2010-03-241-1/+0
* Move components out of traversalaric2010-03-242-313/+0
* Move DAG routines out of traversalaric2010-03-243-215/+0
* Move distance measures out of traversalaric2010-03-243-146/+0
* Move convert_node_labels_to_integers() and relabel_nodes() to convert.pyaric2010-03-233-3/+3
* Add contract scc and test.aric2010-03-112-1/+42
* is_connected() should use single_source_shortest_path().aric2010-03-101-1/+1
* Attempt to speed up bidirectional shortest path by balancing frontier sizes.aric2010-03-091-16/+20
* Raise exception in connectedness tests for null grapharic2009-11-061-0/+10
* Fix bug in shortest_path when source==targetaric2009-09-291-1/+2
View Lorry Controller Status