# Ticket #8786: trac_8786-wikipedia-links.patch

File trac_8786-wikipedia-links.patch, 2.5 KB (added by mvngu, 11 years ago)

based on Sage 4.4

• ## sage/graphs/graph.py

```# 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 r""" Undirected graph. A graph is a set of vertices connected by edges (cf. http://en.wikipedia.org/wiki/Graph_(mathematics) ). A graph is a set of vertices connected by edges. See also the `Wikipedia article on graphs `_. One can very easily create a graph in Sage by typing:: def strong_orientation(self): r""" Returns a strongly connected orientation of the current graph. ( cf. http://en.wikipedia.org/wiki/Strongly_connected_component ) Returns a strongly connected orientation of the current graph. See also the `Wikipedia article on strongly connected component `_. An orientation of a an undirected graph is a digraph obtained by An orientation of an undirected graph is a digraph obtained by giving an unique direction to each of its edges. An orientation is said to be strong if there is a directed path between each pair of vertices. once the vertices of each `S_h` have been merged to create a new graph `G'`, this new graph contains `H` as a subgraph. For more information of minor theory, see http://en.wikipedia.org/wiki/Minor_(graph_theory) For more information, see the `Wikipedia article on graph minor `_. INPUT: Given a graph `G`, a Gomory-Hu tree `T` of `G` is a tree with the same set of vertices, and such that the maximal flow between any two vertices is the same in `G` as in `T`. (see http://en.wikipedia.org/wiki/Gomory%E2%80%93Hu_tree) Note that, in general, a graph admits more than one Gomory-Hu tree. between any two vertices is the same in `G` as in `T`. See the `Wikipedia article on Gomory-Hu tree `_. Note that, in general, a graph admits more than one Gomory-Hu tree. OUTPUT: