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
/
shortest_paths
/
unweighted.py
Commit message (
Expand
)
Author
Age
Files
Lines
*
Added Docstring Example for Bidirectional Shortest Path (#6570)
Vanshika Mishra
2023-03-29
1
-0
/
+7
*
Deprecate shortest_path functions to have consistent return values in v3.3 (#...
Dan Schult
2023-03-28
1
-0
/
+7
*
Optimize _single_shortest_path_length function (#6299)
Tortar
2023-03-28
1
-23
/
+22
*
Fixed return type inconsistencies in shortest path methods documentation (#6528)
Navya Agarwal
2023-03-28
1
-3
/
+3
*
Add dispatching to more shortest path algorithms (#6415)
Erik Welch
2023-02-08
1
-0
/
+6
*
Update docs to include description of the `return_seen` kwarg (#5891)
Sultan Orazbayev
2022-07-25
1
-2
/
+15
*
DOC: Switch from napoleon to numpydoc sphinx extension (#4447)
Ross Barnowski
2020-12-12
1
-1
/
+1
*
Format w/ black==20.8b1
Jarrod Millman
2020-10-06
1
-3
/
+3
*
Format w/ black
Jarrod Millman
2020-07-10
1
-24
/
+28
*
Update string format
Jarrod Millman
2020-01-01
1
-5
/
+5
*
Upgrade to Py36 syntax
Jarrod Millman
2020-01-01
1
-6
/
+6
*
Convert %-format to fstring
Jarrod Millman
2020-01-01
1
-1
/
+1
*
Remove superfluous encoding information
Jarrod Millman
2019-11-11
1
-1
/
+0
*
Remove boiler plate from top of modules
Jarrod Millman
2019-11-11
1
-8
/
+0
*
Optimize _single_shortest_path_length (#3647)
Jonatan Westholm
2019-10-23
1
-6
/
+11
*
Update copyright
Jarrod Millman
2019-03-30
1
-1
/
+1
*
Fix error message for single_target_shortest_path (#3339)
Dan Schult
2019-03-26
1
-1
/
+1
*
Fixed error message for single_source_shortest_path_length (#3323)
Scott Chow
2019-02-23
1
-1
/
+1
*
Replacing `Return` to `Returns` in docs for functions (#3301)
Moradnejad
2019-02-18
1
-1
/
+1
*
Update copyright
Jarrod Millman
2018-01-20
1
-1
/
+1
*
shortest_path return types as discussed for #2510 (#2612)
Dan Schult
2017-08-16
1
-9
/
+10
*
Refactor examples (#2527)
Jarrod Millman
2017-07-21
1
-1
/
+1
*
Fix closeness centrality for DiGraphs (#2418)
Livio Bioglio
2017-07-01
1
-77
/
+223
*
Fix doctest ordering issues in unweighted shortest paths.
Jordi Torrents
2017-04-02
1
-6
/
+22
*
Fix conflict for #1445 and use NodeNotFound exception
Dan Schult
2016-04-22
1
-0
/
+14
|
\
|
*
NetworkXInvalidNode exception added
alexnikleo
2015-06-23
1
-0
/
+13
*
|
Change default role for sphinx to 'obj'
Dan Schult
2016-03-03
1
-3
/
+3
*
|
Update copyrights
Mridul Seth
2016-01-01
1
-1
/
+1
*
|
Update documentation of shortest_path_length
Mridul Seth
2015-08-17
1
-5
/
+6
*
|
Update single_source_shortest_path_length and all_pairs_shortest_path_length ...
Mridul Seth
2015-08-13
1
-16
/
+14
*
|
Merge pull request #1589 from MridulS/succprediter
Dan Schult
2015-06-17
1
-2
/
+2
|
\
\
|
*
|
Remove successors_iter() and predecessors_iter(). G.successors() and G.predec...
Mridul Seth
2015-06-12
1
-2
/
+2
*
|
|
Merge pull request #1588 from MridulS/neigbhorsiter
Dan Schult
2015-06-17
1
-2
/
+2
|
\
\
\
|
*
|
|
Remove neighbors_iter, G.neighbors() now returns an iterator instead of list
Mridul Seth
2015-06-12
1
-2
/
+2
|
|
/
/
*
|
|
Makes Graph.nodes() return iterator instead of list
Jeffrey Finkelstein
2015-06-11
1
-3
/
+3
|
/
/
*
|
Simplify shortest path computation.
Jeffrey Finkelstein
2015-05-10
1
-23
/
+17
*
|
Fix copyrights
JGab
2015-04-21
1
-1
/
+1
|
/
*
Avoid insertion from front of list in bidirectional_shortest_path.
chebee7i
2014-05-12
1
-5
/
+6
*
clean up white-space in shortest_paths
Dan Schult
2012-04-23
1
-21
/
+21
*
Add shortest path tests.
Aric Hagberg
2011-12-10
1
-3
/
+0
*
Even more imports cleanup and exceptions fixed.
Loïc Séguin-C.
2011-02-10
1
-1
/
+1
*
Document shortest paths for dense graphs
Aric Hagberg
2011-01-16
1
-131
/
+2
*
Adding class for incrementally tracking connected components.
Chris Ellison
2010-11-04
1
-3
/
+4
*
Exceptions for shortest paths algos. Addresses #452
Loïc Séguin-C.
2010-10-24
1
-5
/
+6
*
Minor fixes to documentation, mainly to help Sphinx with one line descriptions.
loicseguin
2010-08-09
1
-2
/
+1
*
Merging py3k-1.2 branch into trunk. Addresses #348
loicseguin
2010-08-02
1
-4
/
+4
*
Use standard "import networkx as nx" in all modules
aric
2010-04-17
1
-3
/
+1
*
Remove spurious heapq iimports and comments about deque
dschult
2010-04-05
1
-3
/
+0
*
Improve documentation in shortest path algorithms.
aric
2010-03-25
1
-77
/
+76
*
Split shortest paths algorithms and provide simpler interface
aric
2010-03-24
1
-0
/
+496