1. Mario Fuest
  2. pyreia

Commits

keba  committed 89d9ef5

small doc fixes

  • Participants
  • Parent commits 82e215a
  • Branches default

Comments (0)

Files changed (2)

File docs/algorithms/prim.rst

View file
 receive a Node's child) is minimal.
 
 Currently this Prim implementation uses Binary Heaps (more exactly, pyreia's
-:class:~`pyreia.core.heap.Heap` implementation), therefore only a running time
+:class:`~pyreia.core.heap.Heap` implementation), therefore only a running time
 of :math:`O((V + E) \log(V)) = O(E \log(V))` is reached, where `V` is the number
 of vertices and `E` the number of edges.  Using Fibonacci Heaps the algorithm
 would need only :math:`O(E + V \log(V))` time. [#]_

File pyreia/algorithms/prim_al.py

View file
 
 def prim(node, *args, **kwargs):
     """
-    Prim Algorithms to find a MST.
+    Prim Algorithm to find a MST.
 
     :param node: Any Node from the graph
     :type node: :class:`~pyreia.nodes.Node`