Ticket #8786: trac_8786-wikipedia-links.patch

File trac_8786-wikipedia-links.patch, 2.5 KB (added by mvngu, 10 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 b  
    398398    r"""
    399399    Undirected graph.
    400400
    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)>`_.
    403403
    404404    One can very easily create a graph in Sage by typing::
    405405   
     
    14741474
    14751475    def strong_orientation(self):
    14761476        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>`_.
    14791480
    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
    14811482        giving an unique direction to each of its edges. An orientation
    14821483        is said to be strong if there is a directed path between each
    14831484        pair of vertices.
     
    19261927        once the vertices of each `S_h` have been merged to create
    19271928        a new graph `G'`, this new graph contains `H` as a subgraph.
    19281929
    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>`_.
    19311932
    19321933        INPUT:
    19331934
     
    30413042
    30423043        Given a graph `G`, a Gomory-Hu tree `T` of `G` is a tree
    30433044        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.
    30483048
    30493049        OUTPUT:
    30503050