Skip to content
GitLab
Menu
Projects
Groups
Snippets
Loading...
Help
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in / Register
Toggle navigation
Menu
Open sidebar
Tiago Peixoto
graph-tool
Commits
6ed7bd2e
Commit
6ed7bd2e
authored
Nov 06, 2009
by
Tiago Peixoto
Browse files
Small doc fixes.
parent
b4370e91
Changes
3
Hide whitespace changes
Inline
Side-by-side
Showing
3 changed files
with
3 additions
and
3 deletions
+3
-3
README
README
+1
-1
src/graph_tool/centrality/__init__.py
src/graph_tool/centrality/__init__.py
+1
-1
src/graph_tool/flow/__init__.py
src/graph_tool/flow/__init__.py
+1
-1
No files found.
README
View file @
6ed7bd2e
...
@@ -2,7 +2,7 @@ graph-tool -- a general graph measurement and manipulation python module
...
@@ -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
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,
properties distributions, degree or properties correlations,
clustering, graph filtering, graph layout, and more, as well as a
clustering, graph filtering, graph layout, and more, as well as a
random graph generation routine. For more information and
random graph generation routine. For more information and
...
...
src/graph_tool/centrality/__init__.py
View file @
6ed7bd2e
...
@@ -466,7 +466,7 @@ def absolute_trust(g, trust_map, source = None, vprop=None, n_paths=10000,
...
@@ -466,7 +466,7 @@ def absolute_trust(g, trust_map, source = None, vprop=None, n_paths=10000,
.. math::
.. math::
w_{\{i\to j\}} = \prod_{e\in \{i\to j\}}\{c_e(1-\delta_{t(e),j}) +
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
such that the direct trust of the last edge on the path is not
considered.
considered.
...
...
src/graph_tool/flow/__init__.py
View file @
6ed7bd2e
...
@@ -264,7 +264,7 @@ def kolmogorov_max_flow(g, source, target, capacity, residual=None):
...
@@ -264,7 +264,7 @@ def kolmogorov_max_flow(g, source, target, capacity, residual=None):
The algorithm is defined in [kolmogorov-graph-2003]_ and
The algorithm is defined in [kolmogorov-graph-2003]_ and
[boykov-experimental-2004]_. The worst case complexity is
[boykov-experimental-2004]_. The worst case complexity is
:math:`O(EV^2|C|)`, where :math:`|C|` is the minimum cut (but typically
:math:`O(EV^2|C|)`, where :math:`|C|` is the minimum cut (but typically
perfo
m
rs much better).
perfor
m
s much better).
For a more detailed description, see [boost-kolmogorov]_.
For a more detailed description, see [boost-kolmogorov]_.
...
...
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