index
:
delta/python-packages/networkx.git
MridulS-patch-1
attrgraph
beam-log-2
circleci-project-setup
digraph-edge-subgraph
doc-isom-orderable
doc-typo
docdraft
docs-for-v1.11
dschult-patch-1
dschult-patch-gml
error-message-configuration-model
error-message-eccentricity
fix-d-separation-conflicts
gh-pages
iter_refactor
kl-encoding
main
master
networkx-1.10
nx-sparse
remove-beam-notes
remove-conda
revert-1806-patch-numpy-compatible
revert-3507-master
revert-5156-pin-pyparsing
scipy-pandas-310
v1.10
v1.10.1
v1.11
v1.9
v1.9.1
v2.5
v2.6
v2.8
github.com: networkx/networkx.git
summary
refs
log
tree
commit
diff
log msg
author
committer
range
path:
root
/
networkx
/
algorithms
/
tests
/
test_simple_paths.py
Commit message (
Expand
)
Author
Age
Files
Lines
*
Fix typos (#6620)
Harri Nieminen
2023-04-04
1
-2
/
+2
*
Update pre-commit (#6545)
Jarrod Millman
2023-03-23
1
-1
/
+1
*
Lint using Ruff (#6371)
danieleades
2023-02-19
1
-7
/
+7
*
Update simple_paths.py: consistent behaviour for `is_simple_path` when path c...
Sultan Orazbayev
2022-12-20
1
-0
/
+4
*
Use isort with pre-commit to enforce import guidelines (#5659)
Mridul Seth
2022-06-02
1
-4
/
+5
*
Drop Py37 (#5143)
Jarrod Millman
2021-10-23
1
-2
/
+2
*
Update black (#4814)
Jarrod Millman
2021-05-18
1
-2
/
+2
*
Format python in docstrings (#4168)
Jarrod Millman
2020-08-19
1
-10
/
+6
*
Format w/ black
Jarrod Millman
2020-07-10
1
-127
/
+163
*
Index edges for multi graph simple paths (#3358)
Jorge Martín Pérez
2020-07-07
1
-8
/
+187
*
return empty generator instead of empty list (#3967)
muratgu
2020-07-05
1
-2
/
+2
*
Add weight function for shortest simple paths for #3948 (#3949)
Harold Chan
2020-05-19
1
-0
/
+19
*
Upgrade to Py36 syntax
Jarrod Millman
2020-01-01
1
-18
/
+18
*
PEP8 fixes
Jarrod Millman
2019-10-18
1
-1
/
+1
*
PEP8 fixes to tests
Jarrod Millman
2019-10-18
1
-6
/
+6
*
Replace nose.raises with pytest.raises context manager
Jarrod Millman
2019-10-12
1
-31
/
+30
*
Replace nose.assert_raises with pytest.raises
Jarrod Millman
2019-10-12
1
-11
/
+11
*
Remove unused imports
Jarrod Millman
2019-10-12
1
-3
/
+0
*
Convert nose.tools.assert_* functions into asserts
Jarrod Millman
2019-10-12
1
-66
/
+66
*
Fix `simple_paths` targets parameter (#3208)
last2sword
2019-02-21
1
-5
/
+43
*
Add some tests for two targets
Warren W. Kretzschmar
2018-10-15
1
-3
/
+33
*
In all_simple_paths(). Replace list with OrderedDict for speedup (#3074)
Winni Kretzschmar
2018-07-19
1
-1
/
+8
*
Pep8 fixes
Jarrod Millman
2018-01-20
1
-20
/
+20
*
all_simple_paths should not return cycles. Fix issue #2762 (#2770)
ForFer
2017-11-25
1
-0
/
+6
*
Fix for issue #2427 (#2712)
md0000
2017-10-15
1
-0
/
+93
*
Comply with pep8
Jarrod Millman
2017-08-17
1
-32
/
+59
*
Refactor set_node_attributes() and set_edge_attributes() (#2553)
Michael E. Rose
2017-07-26
1
-4
/
+4
*
Move data structure to private names and replace with readonly structures (#2...
Dan Schult
2017-06-26
1
-3
/
+3
*
Fix test ordering issues for python3.6
Aric Hagberg
2017-04-02
1
-13
/
+16
*
Fix tests.
Valentin Lorentz
2016-07-30
1
-1
/
+1
*
Fix tests failing because of ordering issues.
Valentin Lorentz
2016-07-30
1
-6
/
+6
*
Remove conflicts from #1894 (Update Exception Classes)
Dan Schult
2016-04-22
1
-8
/
+7
|
\
|
*
Add exception class NodeNotFound
Mridul Seth
2015-12-30
1
-9
/
+8
*
|
Handles length zero or one lists in is_simple_path
Jeffrey Finkelstein
2016-04-14
1
-0
/
+25
*
|
Replaces positional arguments with single list.
Jeffrey Finkelstein
2016-04-14
1
-9
/
+9
*
|
Moves is_path from utils to simple_paths.
Jeffrey Finkelstein
2016-04-14
1
-2
/
+50
*
|
Change all X.add_path yp nx.add_path(X,
Dan Schult
2016-02-02
1
-11
/
+11
|
/
*
Use peek(S) instead of next(iter(S)).
Jeffrey Finkelstein
2015-07-17
1
-1
/
+2
*
Improve documentation and add more tests.
Jordi Torrents
2015-04-17
1
-2
/
+74
*
Improve shortest_simple_paths implementation and add more tests.
Jordi Torrents
2015-04-17
1
-8
/
+42
*
Add shortest_simple_paths function.
Jordi Torrents
2015-04-17
1
-0
/
+82
*
Cutoff condition needed in sipmle_paths to avoid spurious corner case.
Aric Hagberg
2012-06-01
1
-1
/
+1
*
Add example in simple_paths. Check for missing source and target.
Aric Hagberg
2012-06-01
1
-0
/
+12
*
Optimized all_simple_paths. Return empty list if cutoff is < 1.
Aric Hagberg
2012-06-01
1
-0
/
+7
*
Rework of algorithm to handle multigraphs with cutoff.
Aric Hagberg
2012-05-06
1
-0
/
+11
*
Tune for graphs v multigraphs since G[n] is much faster if we can use it (for...
Aric Hagberg
2012-04-28
1
-0
/
+16
*
Add all_simple_paths() function.
Aric Hagberg
2012-04-07
1
-0
/
+27