summaryrefslogtreecommitdiff
path: root/networkx/algorithms/tests/test_simple_paths.py
Commit message (Expand)AuthorAgeFilesLines
* Fix typos (#6620)Harri Nieminen2023-04-041-2/+2
* Update pre-commit (#6545)Jarrod Millman2023-03-231-1/+1
* Lint using Ruff (#6371)danieleades2023-02-191-7/+7
* Update simple_paths.py: consistent behaviour for `is_simple_path` when path c...Sultan Orazbayev2022-12-201-0/+4
* Use isort with pre-commit to enforce import guidelines (#5659)Mridul Seth2022-06-021-4/+5
* Drop Py37 (#5143)Jarrod Millman2021-10-231-2/+2
* Update black (#4814)Jarrod Millman2021-05-181-2/+2
* Format python in docstrings (#4168)Jarrod Millman2020-08-191-10/+6
* Format w/ blackJarrod Millman2020-07-101-127/+163
* Index edges for multi graph simple paths (#3358)Jorge Martín Pérez2020-07-071-8/+187
* return empty generator instead of empty list (#3967)muratgu2020-07-051-2/+2
* Add weight function for shortest simple paths for #3948 (#3949)Harold Chan2020-05-191-0/+19
* Upgrade to Py36 syntaxJarrod Millman2020-01-011-18/+18
* PEP8 fixesJarrod Millman2019-10-181-1/+1
* PEP8 fixes to testsJarrod Millman2019-10-181-6/+6
* Replace nose.raises with pytest.raises context managerJarrod Millman2019-10-121-31/+30
* Replace nose.assert_raises with pytest.raisesJarrod Millman2019-10-121-11/+11
* Remove unused importsJarrod Millman2019-10-121-3/+0
* Convert nose.tools.assert_* functions into assertsJarrod Millman2019-10-121-66/+66
* Fix `simple_paths` targets parameter (#3208)last2sword2019-02-211-5/+43
* Add some tests for two targetsWarren W. Kretzschmar2018-10-151-3/+33
* In all_simple_paths(). Replace list with OrderedDict for speedup (#3074)Winni Kretzschmar2018-07-191-1/+8
* Pep8 fixesJarrod Millman2018-01-201-20/+20
* all_simple_paths should not return cycles. Fix issue #2762 (#2770)ForFer2017-11-251-0/+6
* Fix for issue #2427 (#2712)md00002017-10-151-0/+93
* Comply with pep8Jarrod Millman2017-08-171-32/+59
* Refactor set_node_attributes() and set_edge_attributes() (#2553)Michael E. Rose2017-07-261-4/+4
* Move data structure to private names and replace with readonly structures (#2...Dan Schult2017-06-261-3/+3
* Fix test ordering issues for python3.6Aric Hagberg2017-04-021-13/+16
* Fix tests.Valentin Lorentz2016-07-301-1/+1
* Fix tests failing because of ordering issues.Valentin Lorentz2016-07-301-6/+6
* Remove conflicts from #1894 (Update Exception Classes)Dan Schult2016-04-221-8/+7
|\
| * Add exception class NodeNotFoundMridul Seth2015-12-301-9/+8
* | Handles length zero or one lists in is_simple_pathJeffrey Finkelstein2016-04-141-0/+25
* | Replaces positional arguments with single list.Jeffrey Finkelstein2016-04-141-9/+9
* | Moves is_path from utils to simple_paths.Jeffrey Finkelstein2016-04-141-2/+50
* | Change all X.add_path yp nx.add_path(X,Dan Schult2016-02-021-11/+11
|/
* Use peek(S) instead of next(iter(S)).Jeffrey Finkelstein2015-07-171-1/+2
* Improve documentation and add more tests.Jordi Torrents2015-04-171-2/+74
* Improve shortest_simple_paths implementation and add more tests.Jordi Torrents2015-04-171-8/+42
* Add shortest_simple_paths function.Jordi Torrents2015-04-171-0/+82
* Cutoff condition needed in sipmle_paths to avoid spurious corner case.Aric Hagberg2012-06-011-1/+1
* Add example in simple_paths. Check for missing source and target.Aric Hagberg2012-06-011-0/+12
* Optimized all_simple_paths. Return empty list if cutoff is < 1.Aric Hagberg2012-06-011-0/+7
* Rework of algorithm to handle multigraphs with cutoff.Aric Hagberg2012-05-061-0/+11
* Tune for graphs v multigraphs since G[n] is much faster if we can use it (for...Aric Hagberg2012-04-281-0/+16
* Add all_simple_paths() function.Aric Hagberg2012-04-071-0/+27