# HG changeset patch
# User Minh Van Nguyen <nguyenminh2@gmail.com>
# Date 1272458371 25200
# Node ID 9188e33e33ed5708fcccff34d429d701dec3baaa
# Parent 5af3155634cd101e69191b123948f78e6981b931
#8786: reviewer patch: autogenerated broken links to Wikipedia
diff --git a/sage/graphs/digraph.py b/sage/graphs/digraph.py
a
|
b
|
|
18 | 18 | Directed graph. |
19 | 19 | |
20 | 20 | A digraph or directed graph is a set of vertices connected by oriented |
21 | | edges. |
22 | | |
| 21 | edges. For more information, see the |
23 | 22 | `Wikipedia article on digraphs |
24 | | <http://en.wikipedia.org/wiki/Digraph_%28mathematics%29>`_ |
| 23 | <http://en.wikipedia.org/wiki/Digraph_%28mathematics%29>`_. |
25 | 24 | |
26 | 25 | One can very easily create a directed graph in Sage by typing:: |
27 | 26 | |
… |
… |
|
1100 | 1099 | The minimum feedback edge set of a digraph is a set of edges |
1101 | 1100 | that intersect all the circuits of the digraph. |
1102 | 1101 | Equivalently, a minimum feedback arc set of a DiGraph is a set |
1103 | | `S` of arcs such that the digraph `G-S` is acyclic. |
1104 | | |
1105 | | `Wikipedia article on Feedback arc sets |
| 1102 | `S` of arcs such that the digraph `G-S` is acyclic. For more |
| 1103 | information, see the |
| 1104 | `Wikipedia article on feedback arc sets |
1106 | 1105 | <http://en.wikipedia.org/wiki/Feedback_arc_set>`_. |
1107 | 1106 | |
1108 | 1107 | INPUT : |
… |
… |
|
1209 | 1208 | The minimum feedback vertex set of a digraph is a set of vertices |
1210 | 1209 | that intersect all the circuits of the digraph. |
1211 | 1210 | Equivalently, a minimum feedback vertex set of a DiGraph is a set |
1212 | | `S` of vertices such that the digraph `G-S` is acyclic. |
1213 | | |
1214 | | `Wikipedia article on Feedback vertex sets |
| 1211 | `S` of vertices such that the digraph `G-S` is acyclic. For more |
| 1212 | information, see the |
| 1213 | `Wikipedia article on feedback vertex sets |
1215 | 1214 | <http://en.wikipedia.org/wiki/Feedback_vertex_set>`_. |
1216 | 1215 | |
1217 | 1216 | INPUT : |
diff --git a/sage/graphs/digraph_generators.py b/sage/graphs/digraph_generators.py
a
|
b
|
|
287 | 287 | In this digraph, there is an arc `w_1w_2` if `w_2` |
288 | 288 | can be obtained from `w_1` by removing the leftmost |
289 | 289 | letter and adding a new letter at its right end. |
290 | | |
291 | | `Wikipedia article on the De Bruijn graph |
292 | | <http://en.wikipedia.org/wiki/De_Bruijn_graph>`_ |
| 290 | For more information, see the |
| 291 | `Wikipedia article on De Bruijn graph |
| 292 | <http://en.wikipedia.org/wiki/De_Bruijn_graph>`_. |
293 | 293 | |
294 | 294 | INPUT: |
295 | 295 | |
diff --git a/sage/graphs/generic_graph.py b/sage/graphs/generic_graph.py
a
|
b
|
|
3027 | 3027 | |
3028 | 3028 | A minimum edge cut between two vertices `s` and `t` of self |
3029 | 3029 | is a set `A` of edges of minimum weight such that the graph |
3030 | | obtained by removing `A` from self is disconnected. |
3031 | | |
| 3030 | obtained by removing `A` from self is disconnected. For more |
| 3031 | information, see the |
3032 | 3032 | `Wikipedia article on cuts |
3033 | 3033 | <http://en.wikipedia.org/wiki/Cut_%28graph_theory%29>`_. |
3034 | 3034 | |
… |
… |
|
3154 | 3154 | |
3155 | 3155 | A vertex cut between two non adjacent vertices is a set `U` |
3156 | 3156 | of vertices of self such that the graph obtained by removing |
3157 | | `U` from self is disconnected. |
3158 | | |
| 3157 | `U` from self is disconnected. For more information, see the |
3159 | 3158 | `Wikipedia article on cuts |
3160 | | <http://en.wikipedia.org/wiki/Cut_%28graph_theory%29>`_ |
3161 | | |
| 3159 | <http://en.wikipedia.org/wiki/Cut_%28graph_theory%29>`_. |
3162 | 3160 | |
3163 | 3161 | INPUT: |
3164 | 3162 | |
… |
… |
|
3268 | 3266 | A minimum vertex cover of a graph is a set `S` of |
3269 | 3267 | vertices such that each edge is incident to at least |
3270 | 3268 | one element of `S`, and such that `S` is of minimum |
3271 | | cardinality. |
3272 | | |
| 3269 | cardinality. For more information, see the |
3273 | 3270 | `Wikipedia article on vertex cover |
3274 | 3271 | <http://en.wikipedia.org/wiki/Vertex_cover>`_. |
3275 | 3272 | |
… |
… |
|
3359 | 3356 | The minimum feedback edge set of a digraph is a set of edges |
3360 | 3357 | that intersect all the circuits of the digraph. |
3361 | 3358 | Equivalently, a minimum feedback arc set of a DiGraph is a set |
3362 | | `S` of arcs such that the digraph `G-S` is acyclic. |
3363 | | |
| 3359 | `S` of arcs such that the digraph `G-S` is acyclic. For more |
| 3360 | information, see the |
3364 | 3361 | `Wikipedia article on feedback arc sets |
3365 | 3362 | <http://en.wikipedia.org/wiki/Feedback_arc_set>`_. |
3366 | 3363 | |
… |
… |
|
3473 | 3470 | The minimum feedback vertex set of a digraph is a set of vertices |
3474 | 3471 | that intersect all the circuits of the digraph. |
3475 | 3472 | Equivalently, a minimum feedback vertex set of a DiGraph is a set |
3476 | | `S` of vertices such that the digraph `G-S` is acyclic. |
3477 | | |
3478 | | `Wikipedia article on Feedback vertex sets |
| 3473 | `S` of vertices such that the digraph `G-S` is acyclic. For more |
| 3474 | information, see the |
| 3475 | `Wikipedia article on feedback vertex sets |
3479 | 3476 | <http://en.wikipedia.org/wiki/Feedback_vertex_set>`_. |
3480 | 3477 | |
3481 | 3478 | INPUT : |
… |
… |
|
3581 | 3578 | |
3582 | 3579 | def max_cut(self,value_only=True,use_edge_labels=True, vertices=False): |
3583 | 3580 | r""" |
3584 | | Returns a maximum edge cut of the graph |
3585 | | |
| 3581 | Returns a maximum edge cut of the graph. For more information, see the |
3586 | 3582 | `Wikipedia article on cuts |
3587 | 3583 | <http://en.wikipedia.org/wiki/Cut_%28graph_theory%29>`_. |
3588 | 3584 | |
… |
… |
|
3718 | 3714 | def flow(self,x,y,value_only=True,integer=False, use_edge_labels=True,vertex_bound=False): |
3719 | 3715 | r""" |
3720 | 3716 | Returns a maximum flow in the graph from ``x`` to ``y`` |
3721 | | represented by an optimal valuation of the edges. |
3722 | | |
3723 | | `Wikipedia article on flows |
3724 | | <http://en.wikipedia.org/wiki/Max_flow_problem>`_. |
3725 | | |
| 3717 | represented by an optimal valuation of the edges. For more |
| 3718 | information, see the |
| 3719 | `Wikipedia article on maximum flow |
| 3720 | <http://en.wikipedia.org/wiki/Max_flow>`_. |
3726 | 3721 | |
3727 | 3722 | As an optimization problem, is can be expressed this way : |
3728 | 3723 | |
… |
… |
|
3982 | 3977 | def matching(self,value_only=False, use_edge_labels=True): |
3983 | 3978 | r""" |
3984 | 3979 | Returns a maximum weighted matching of the graph |
3985 | | represented by the list of its edges. |
3986 | | |
| 3980 | represented by the list of its edges. For more information, see the |
3987 | 3981 | `Wikipedia article on matchings |
3988 | | <http://en.wikipedia.org/wiki/Matching>`_. |
3989 | | |
| 3982 | <http://en.wikipedia.org/wiki/Matching_%28graph_theory%29>`_. |
3990 | 3983 | |
3991 | 3984 | Given a graph `G` such that each edge `e` has a weight `w_e`, |
3992 | 3985 | a maximum matching is a subset `S` of the edges of `G` of |
… |
… |
|
4051 | 4044 | def dominating_set(self, independent=False, value_only=False,log=0): |
4052 | 4045 | r""" |
4053 | 4046 | Returns a minimum dominating set of the graph |
4054 | | represented by the list of its vertices. |
4055 | | |
| 4047 | represented by the list of its vertices. For more information, see the |
4056 | 4048 | `Wikipedia article on dominating sets |
4057 | 4049 | <http://en.wikipedia.org/wiki/Dominating_set>`_. |
4058 | 4050 | |
… |
… |
|
4138 | 4130 | |
4139 | 4131 | def edge_connectivity(self,value_only=True,use_edge_labels=False, vertices=False): |
4140 | 4132 | r""" |
4141 | | Returns the edge connectivity of the graph |
4142 | | |
| 4133 | Returns the edge connectivity of the graph. For more information, see |
| 4134 | the |
4143 | 4135 | `Wikipedia article on connectivity |
4144 | 4136 | <http://en.wikipedia.org/wiki/Connectivity_(graph_theory)>`_. |
4145 | 4137 | |
… |
… |
|
4332 | 4324 | |
4333 | 4325 | def vertex_connectivity(self,value_only=True, sets=False): |
4334 | 4326 | r""" |
4335 | | Returns the vertex connectivity of the graph |
4336 | | |
| 4327 | Returns the vertex connectivity of the graph. For more information, |
| 4328 | see the |
4337 | 4329 | `Wikipedia article on connectivity |
4338 | 4330 | <http://en.wikipedia.org/wiki/Connectivity_(graph_theory)>`_. |
4339 | | |
4340 | 4331 | |
4341 | 4332 | INPUT: |
4342 | 4333 | |
… |
… |
|
8292 | 8283 | Performs a Lex BFS on the graph. |
8293 | 8284 | |
8294 | 8285 | A Lex BFS ( or Lexicographic Breadth-First Search ) is a Breadth |
8295 | | First Search used for the recognition of Chordal Graphs. |
8296 | | |
| 8286 | First Search used for the recognition of Chordal Graphs. For more |
| 8287 | information, see the |
8297 | 8288 | `Wikipedia article on Lex-BFS |
8298 | | <http://en.wikipedia.org/wiki/Lexicographic_breadth-first_search>`_ |
| 8289 | <http://en.wikipedia.org/wiki/Lexicographic_breadth-first_search>`_. |
8299 | 8290 | |
8300 | 8291 | INPUT: |
8301 | 8292 | |