# HG changeset patch
# User Minh Van Nguyen <nguyenminh2@gmail.com>
# Date 1272435432 25200
# Node ID 4a624097a97bdd20e5bcc484ae37bc9425adbb57
# Parent e2ccb846f2962cbe254f534ececfd0fbc9ff5045
#8786: autogenerated broken links to Wikipedia
diff --git a/sage/graphs/graph.py b/sage/graphs/graph.py
a
|
b
|
|
398 | 398 | r""" |
399 | 399 | Undirected graph. |
400 | 400 | |
401 | | A graph is a set of vertices connected by edges |
402 | | (cf. http://en.wikipedia.org/wiki/Graph_(mathematics) ). |
| 401 | A graph is a set of vertices connected by edges. See also the |
| 402 | `Wikipedia article on graphs <http://en.wikipedia.org/wiki/Graph_(mathematics)>`_. |
403 | 403 | |
404 | 404 | One can very easily create a graph in Sage by typing:: |
405 | 405 | |
… |
… |
|
1474 | 1474 | |
1475 | 1475 | def strong_orientation(self): |
1476 | 1476 | r""" |
1477 | | Returns a strongly connected orientation of the current graph. |
1478 | | ( cf. http://en.wikipedia.org/wiki/Strongly_connected_component ) |
| 1477 | Returns a strongly connected orientation of the current graph. See |
| 1478 | also the |
| 1479 | `Wikipedia article on strongly connected component <http://en.wikipedia.org/wiki/Strongly_connected_component>`_. |
1479 | 1480 | |
1480 | | An orientation of a an undirected graph is a digraph obtained by |
| 1481 | An orientation of an undirected graph is a digraph obtained by |
1481 | 1482 | giving an unique direction to each of its edges. An orientation |
1482 | 1483 | is said to be strong if there is a directed path between each |
1483 | 1484 | pair of vertices. |
… |
… |
|
1926 | 1927 | once the vertices of each `S_h` have been merged to create |
1927 | 1928 | a new graph `G'`, this new graph contains `H` as a subgraph. |
1928 | 1929 | |
1929 | | For more information of minor theory, see |
1930 | | http://en.wikipedia.org/wiki/Minor_(graph_theory) |
| 1930 | For more information, see the |
| 1931 | `Wikipedia article on graph minor <http://en.wikipedia.org/wiki/Minor_%28graph_theory%29>`_. |
1931 | 1932 | |
1932 | 1933 | INPUT: |
1933 | 1934 | |
… |
… |
|
3041 | 3042 | |
3042 | 3043 | Given a graph `G`, a Gomory-Hu tree `T` of `G` is a tree |
3043 | 3044 | with the same set of vertices, and such that the maximal flow |
3044 | | between any two vertices is the same in `G` as in `T`. |
3045 | | (see http://en.wikipedia.org/wiki/Gomory%E2%80%93Hu_tree) |
3046 | | Note that, in general, a graph admits more than one Gomory-Hu |
3047 | | tree. |
| 3045 | between any two vertices is the same in `G` as in `T`. See the |
| 3046 | `Wikipedia article on Gomory-Hu tree <http://en.wikipedia.org/wiki/Gomory%E2%80%93Hu_tree>`_. |
| 3047 | Note that, in general, a graph admits more than one Gomory-Hu tree. |
3048 | 3048 | |
3049 | 3049 | OUTPUT: |
3050 | 3050 | |