Ticket #8786: trac_8786-other_fixes.patch

sage/graphs/digraph.py

@@ -18 +18 @@
     Directed graph.
 
     A digraph or directed graph is a set of vertices connected by oriented
-    edges (cf. http://en.wikipedia.org/wiki/Digraph_%28mathematics%29 ).
+    edges.
+
+    `Wikipedia article on digraphs 
+    <http://en.wikipedia.org/wiki/Digraph_%28mathematics%29>`_
 
     One can very easily create a directed graph in Sage by typing::
     
@@ -1099 +1102 @@
         Equivalently, a minimum feedback arc set of a DiGraph is a set
         `S` of arcs such that the digraph `G-S` is acyclic.
 
-        For more informations, see 
-        ( http://en.wikipedia.org/wiki/Feedback_arc_set )
+        `Wikipedia article on Feedback arc sets
+        <http://en.wikipedia.org/wiki/Feedback_arc_set>`_.
 
         INPUT :
 
@@ -1208 +1211 @@
         Equivalently, a minimum feedback vertex set of a DiGraph is a set
         `S` of vertices such that the digraph `G-S` is acyclic.
 
-        For more informations, see 
-        ( http://en.wikipedia.org/wiki/Feedback_vertex_set )
+        `Wikipedia article on Feedback vertex sets
+        <http://en.wikipedia.org/wiki/Feedback_vertex_set>`_.
 
         INPUT :
 

sage/graphs/digraph_generators.py

@@ -287 +287 @@
         In this digraph, there is an arc `w_1w_2` if `w_2`
         can be obtained from `w_1` by removing the leftmost
         letter and adding a new letter at its right end.
-        ( more information on this page :
-        http://en.wikipedia.org/wiki/De_Bruijn_graph )
+
+        `Wikipedia article on the De Bruijn graph
+        <http://en.wikipedia.org/wiki/De_Bruijn_graph>`_
 
         INPUT:
 

sage/graphs/generic_graph.py

@@ -3028 +3028 @@
         A minimum edge cut between two vertices `s` and `t` of self
         is a set `A` of edges of minimum weight such that the graph
         obtained by removing `A` from self is disconnected.
-        ( cf. http://en.wikipedia.org/wiki/Cut_%28graph_theory%29 )
+        
+        `Wikipedia article on cuts 
+        <http://en.wikipedia.org/wiki/Cut_%28graph_theory%29>`_.
         
         INPUT:
 
@@ -3153 +3155 @@
         A vertex cut between two non adjacent vertices is a set `U`
         of vertices of self such that the graph obtained by removing
         `U` from self is disconnected.
-        ( cf. http://en.wikipedia.org/wiki/Cut_%28graph_theory%29 )
+
+        `Wikipedia article on cuts
+        <http://en.wikipedia.org/wiki/Cut_%28graph_theory%29>`_
     
         
         INPUT:
@@ -3265 +3269 @@
         vertices such that each edge is incident to at least
         one element of `S`, and such that `S` is of minimum 
         cardinality.
-        ( cf. http://en.wikipedia.org/wiki/Vertex_cover )
+
+        `Wikipedia article on vertex cover
+        <http://en.wikipedia.org/wiki/Vertex_cover>`_.
 
         Equivalently, a vertex cover is defined as the
         complement of an independent set.
@@ -3353 +3359 @@
         Equivalently, a minimum feedback arc set of a DiGraph is a set
         `S` of arcs such that the digraph `G-S` is acyclic.
 
-        For more informations, see 
-        ( http://en.wikipedia.org/wiki/Feedback_arc_set )
+        `Wikipedia article on feedback arc sets
+        <http://en.wikipedia.org/wiki/Feedback_arc_set>`_.
 
         INPUT :
 
@@ -3467 +3473 @@
         Equivalently, a minimum feedback vertex set of a DiGraph is a set
         `S` of vertices such that the digraph `G-S` is acyclic.
 
-        For more informations, see 
-        ( http://en.wikipedia.org/wiki/Feedback_vertex_set )
+        `Wikipedia article on Feedback vertex sets
+        <http://en.wikipedia.org/wiki/Feedback_vertex_set>`_.
 
         INPUT :
 
@@ -3574 +3580 @@
     def max_cut(self,value_only=True,use_edge_labels=True, vertices=False):
         r"""
         Returns a maximum edge cut of the graph
-        ( cf. http://en.wikipedia.org/wiki/Cut_%28graph_theory%29 )
+        
+        `Wikipedia article on cuts 
+        <http://en.wikipedia.org/wiki/Cut_%28graph_theory%29>`_.
         
         INPUT:
     
@@ -3708 +3716 @@
     def flow(self,x,y,value_only=True,integer=False, use_edge_labels=True,vertex_bound=False):
         r"""
         Returns a maximum flow in the graph from ``x`` to ``y``
-        ( cf. http://en.wikipedia.org/wiki/Max_flow_problem )
         represented by an optimal valuation of the edges.
 
+        `Wikipedia article on flows 
+        <http://en.wikipedia.org/wiki/Max_flow_problem>`_.
+
+
         As an optimization problem, is can be expressed this way :
 
         .. MATH::
@@ -3969 +3980 @@
     def matching(self,value_only=False, use_edge_labels=True):
         r"""
         Returns a maximum weighted matching of the graph
-        ( cf. http://en.wikipedia.org/wiki/Matching )
         represented by the list of its edges.
 
+        `Wikipedia article on matchings
+        <http://en.wikipedia.org/wiki/Matching>`_.
+
+
         Given a graph `G` such that each edge `e` has a weight `w_e`,
         a maximum matching is a subset `S` of the edges of `G` of
         maximum weight such that no two edges of `S` are incident
@@ -4035 +4049 @@
     def dominating_set(self, independent=False, value_only=False,log=0):
         r"""
         Returns a minimum dominating set of the graph
-        ( cf. http://en.wikipedia.org/wiki/Dominating_set )
         represented by the list of its vertices.
 
+        `Wikipedia article on dominating sets
+        <http://en.wikipedia.org/wiki/Dominating_set>`_.
+
         A minimum dominating set `S` of a graph `G` is 
         a set of its vertices of minimal cardinality such 
         that any vertex of `G` is in `S` or has one of its neighbors 
@@ -4121 +4137 @@
     def edge_connectivity(self,value_only=True,use_edge_labels=False, vertices=False):
         r"""
         Returns the edge connectivity of the graph
-        ( cf. http://en.wikipedia.org/wiki/Connectivity_(graph_theory) )
+
+        `Wikipedia article on connectivity
+        <http://en.wikipedia.org/wiki/Connectivity_(graph_theory)>`_.
     
         INPUT:
     
@@ -4313 +4331 @@
     def vertex_connectivity(self,value_only=True, sets=False):
         r"""
         Returns the vertex connectivity of the graph
-        ( cf. http://en.wikipedia.org/wiki/Connectivity_(graph_theory) )
+
+        `Wikipedia article on connectivity
+        <http://en.wikipedia.org/wiki/Connectivity_(graph_theory)>`_.
     
         
         INPUT:
@@ -8272 +8292 @@
         A Lex BFS ( or Lexicographic Breadth-First Search ) is a Breadth 
         First Search used for the recognition of Chordal Graphs.
     
-        More information on this page : 
-        http://en.wikipedia.org/wiki/Lexicographic_breadth-first_search
+        `Wikipedia article on Lex-BFS
+        <http://en.wikipedia.org/wiki/Lexicographic_breadth-first_search>`_
     
         INPUT: