Skip to content
GitLab
Menu
Projects
Groups
Snippets
Loading...
Help
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in / Register
Toggle navigation
Menu
Open sidebar
Tiago Peixoto
graphtool
Commits
9fcc539d
Commit
9fcc539d
authored
Apr 01, 2016
by
Tiago Peixoto
Browse files
Fix some docstring typos
parent
252f3583
Changes
1
Hide whitespace changes
Inline
Sidebyside
src/graph_tool/topology/__init__.py
View file @
9fcc539d
...
...
@@ 1179,7 +1179,7 @@ def shortest_distance(g, source=None, target=None, weights=None,
If a source is given, the distances are calculated with a breadthfirst
search (BFS) or Dijkstra's algorithm [dijkstra]_, if weights are given. If
``negative_weights == True``, the BellmanFord algorithm is used
[bellman
_
ford]_, which accepts negative weights, as long as there are no
[bellman

ford]_, which accepts negative weights, as long as there are no
negative loops. If source is not given, the distances are calculated with
Johnson's algorithm [johnsonapsp]_. If dense=True, the FloydWarshall
algorithm [floydwarshallapsp]_ is used instead.
...
...
@@ 1350,7 +1350,7 @@ def shortest_path(g, source, target, weights=None, negative_weights=False,
The paths are computed with a breadthfirst search (BFS) or Dijkstra's
algorithm [dijkstra]_, if weights are given. If ``negative_weights ==
True``, the BellmanFord algorithm is used [bellman
_
ford]_, which accepts
True``, the BellmanFord algorithm is used [bellman

ford]_, which accepts
negative weights, as long as there are no negative loops.
The algorithm runs in :math:`O(V + E)` time, or :math:`O(V \log V)` if
...
...
@@ 1490,7 +1490,7 @@ def all_shortest_paths(g, source, target, weights=None, negative_weights=False,
The paths are computed with a breadthfirst search (BFS) or Dijkstra's
algorithm [dijkstra]_, if weights are given. If ``negative_weights ==
True``, the BellmanFord algorithm is used [bellman
_
ford]_, which accepts
True``, the BellmanFord algorithm is used [bellman

ford]_, which accepts
negative weights, as long as there are no negative loops.
If both ``dist_map`` and ``pred_map` are provided, the search is not
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
.
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment