Commit 00e73e78 authored by Tiago Peixoto's avatar Tiago Peixoto
Browse files

all_predecessors(): fix docstring

This fixes issue #619
parent 54b7fb85
......@@ -2147,7 +2147,7 @@ def shortest_path(g, source, target, weights=None, negative_weights=False,
def all_predecessors(g, dist_map, pred_map, weights=None, epsilon=1e-8):
"""Return a property map with all possible predecessors in the search tree
determined by ``dist_map`` and ``pred_map``.
determined by ``dist_map`` and ``pred_map``.
Parameters
----------
......@@ -2156,7 +2156,7 @@ def all_predecessors(g, dist_map, pred_map, weights=None, epsilon=1e-8):
dist_map : :class:`~graph_tool.VertexPropertyMap`
Vertex property map with the distances from ``source`` to all other
vertices.
pred_map : :class:`~graph_tool.VertexPropertyMap` (optional, default: None)
pred_map : :class:`~graph_tool.VertexPropertyMap`
Vertex property map with the predecessors in the search tree.
weights : :class:`~graph_tool.EdgePropertyMap` (optional, default: None)
The edge weights.
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment