Small doc fixes.

README

@@ -2,7 +2,7 @@ graph-tool -- a general graph measurement and manipulation python module
 =========================================================================
 
 This is graph-tool, a python module which contains general graph
-measurements data structures andalgorithms, such as degree or
+measurements data structures and algorithms, such as degree or
 properties distributions, degree or properties correlations,
 clustering, graph filtering, graph layout, and more, as well as a
 random graph generation routine. For more information and

src/graph_tool/centrality/__init__.py

@@ -466,7 +466,7 @@ def absolute_trust(g, trust_map, source = None, vprop=None, n_paths=10000,
     .. math::
 
        w_{\{i\to j\}} = \prod_{e\in \{i\to j\}}\{c_e(1-\delta_{t(e),j}) +
-                                                 \delta_{t(e),j}},
+                                                 \delta_{t(e),j}\},
 
     such that the direct trust of the last edge on the path is not
     considered.

src/graph_tool/flow/__init__.py

@@ -264,7 +264,7 @@ def kolmogorov_max_flow(g, source, target, capacity, residual=None):
     The algorithm is defined in [kolmogorov-graph-2003]_ and
     [boykov-experimental-2004]_. The worst case complexity is
     :math:`O(EV^2|C|)`, where :math:`|C|` is the minimum cut (but typically
-    perfomrs much better).
+    performs much better).
 
     For a more detailed description, see [boost-kolmogorov]_.