Commit 69810889 authored by Tiago Peixoto's avatar Tiago Peixoto

Trivial docstring fix

parent 27a1411d
Pipeline #390 passed with stage
in 415 minutes and 18 seconds
......@@ -415,7 +415,7 @@ def closeness(g, weight=None, source=None, vprop=None, norm=True, harmonic=False
:math:`V-1`.
The algorithm complexity of :math:`O(V(V + E))` for unweighted graphs and
:math:`O(V(v+E) \log V)` for weighted graphs. If the option ``source`` is
:math:`O(V(V+E) \log V)` for weighted graphs. If the option ``source`` is
specified, this drops to :math:`O(V + E)` and :math:`O((V+E)\log V)`
respectively.
......
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