Skip to content
GitLab
Projects
Groups
Snippets
Help
Loading...
Help
What's new
10
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in / Register
Toggle navigation
Open sidebar
Tiago Peixoto
graph-tool
Commits
5b665fcc
Commit
5b665fcc
authored
Oct 21, 2015
by
Tiago Peixoto
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
More corrections to random_spanning_tree()'s docstring.
parent
c8b9f071
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
4 additions
and
3 deletions
+4
-3
src/graph_tool/topology/__init__.py
src/graph_tool/topology/__init__.py
+4
-3
No files found.
src/graph_tool/topology/__init__.py
View file @
5b665fcc
...
...
@@ -518,9 +518,10 @@ def random_spanning_tree(g, weights=None, root=None, tree_map=None):
-----
The running time for this algorithm is :math:`O(\tau)`, with :math:`\tau`
being the mean hitting time of a random walk on the graph. In typical cases
(sparse random graphs) the running time is :math:`O(V)`, with :math:`V`
being the number of vertices in the graph.
being the mean hitting time of a random walk on the graph. In the worse case,
we have :math:`\tau \sim O(V^3)`, with :math:`V` being the number of
vertices in the graph. However, in much more typical cases (e.g. sparse
random graphs) the running time is simply :math:`O(V)`.
Examples
--------
...
...
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