Commit 4e60cbfe authored by Tiago Peixoto's avatar Tiago Peixoto
Browse files

Fix typos in subgraph_isomorphism() docstring

parent 61ccc6f0
...@@ -125,17 +125,16 @@ def subgraph_isomorphism(sub, g): ...@@ -125,17 +125,16 @@ def subgraph_isomorphism(sub, g):
Notes Notes
----- -----
The algorithm used is described in [ullman-algorithm-1976]. It has The algorithm used is described in [ullmann-algorithm-1976]. It has
worse-case complexity of :math:`O(N_{\text{g}}^{N_\text{sub}})`, but for worse-case complexity of :math:`O(N_g^{N_{sub}})`, but for random graphs it
random graphs it typically has a complexity of typically has a complexity of :math:`O(N_g^\gamma)` with :math:`\gamma`
:math:`O(N_{\text{g}}^\gamma)` with :math:`\gamma` depending sub-linearly on depending sub-linearly on the size of `sub`.
the size of `sub`.
References References
---------- ----------
.. [ullman-algorithm-1976] Ullmann, J. R., "An algorithm for subgraph .. [ullmann-algorithm-1976] Ullmann, J. R., "An algorithm for subgraph
isomorphism", Journal of the ACM 23 (1): 31–42, 1976, doi:10.1145/321921.321925 isomorphism", Journal of the ACM 23 (1): 31–42, 1976, doi:10.1145/321921.321925
... [subgraph-isormophism-wikipedia] http://en.wikipedia.org/wiki/Subgraph_isomorphism_problem .. [subgraph-isormophism-wikipedia] http://en.wikipedia.org/wiki/Subgraph_isomorphism_problem
""" """
# vertex and edge labels disabled for the time being, until GCC is capable # vertex and edge labels disabled for the time being, until GCC is capable
......
Supports Markdown
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