summaryrefslogtreecommitdiff
path: root/networkx/algorithms/simple_paths.py
Commit message (Expand)AuthorAgeFilesLines
...
| * | Makes Graph.nodes() return iterator instead of listJeffrey Finkelstein2015-06-111-8/+8
| |/
* | Spelling error ExamplesAric Hagberg2015-06-131-2/+2
|/
* Improve documentation and add more tests.Jordi Torrents2015-04-171-10/+34
* Improve shortest_simple_paths implementation and add more tests.Jordi Torrents2015-04-171-16/+41
* Add shortest_simple_paths function.Jordi Torrents2015-04-171-2/+473
* bugfix per issue 797Seth Bromberger2012-12-181-1/+1
* Add better examples and docs for all_simple_paths.Aric Hagberg2012-06-181-10/+12
* fix failing doctest in all_simple_paths()Aric Hagberg2012-06-121-1/+2
* Cutoff condition needed in sipmle_paths to avoid spurious corner case.Aric Hagberg2012-06-011-0/+4
* Add example in simple_paths. Check for missing source and target.Aric Hagberg2012-06-011-8/+17
* Remove cutoff condition check. Update docs.Aric Hagberg2012-06-011-5/+3
* Optimized all_simple_paths. Return empty list if cutoff is < 1.Aric Hagberg2012-06-011-9/+44
* Rework of algorithm to handle multigraphs with cutoff.Aric Hagberg2012-05-061-11/+6
* Tune for graphs v multigraphs since G[n] is much faster if we can use it (for...Aric Hagberg2012-04-281-2/+8
* Fix some docstring errors.Aric Hagberg2012-04-071-1/+1
* Add all_simple_paths() function.Aric Hagberg2012-04-071-0/+74