# Ticket #8786: trac_8786-reviewer.patch

File trac_8786-reviewer.patch, 8.2 KB (added by mvngu, 10 years ago)
• ## sage/graphs/digraph.py

```# 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 Directed graph. A digraph or directed graph is a set of vertices connected by oriented edges. edges. For more information, see the `Wikipedia article on digraphs `_ `_. One can very easily create a directed graph in Sage by typing:: The minimum feedback edge set of a digraph is a set of edges that intersect all the circuits of the digraph. Equivalently, a minimum feedback arc set of a DiGraph is a set `S` of arcs such that the digraph `G-S` is acyclic. `Wikipedia article on Feedback arc sets `S` of arcs such that the digraph `G-S` is acyclic. For more information, see the `Wikipedia article on feedback arc sets `_. INPUT : The minimum feedback vertex set of a digraph is a set of vertices that intersect all the circuits of the digraph. Equivalently, a minimum feedback vertex set of a DiGraph is a set `S` of vertices such that the digraph `G-S` is acyclic. `Wikipedia article on Feedback vertex sets `S` of vertices such that the digraph `G-S` is acyclic. For more information, see the `Wikipedia article on feedback vertex sets `_. INPUT :
• ## sage/graphs/digraph_generators.py

`diff --git a/sage/graphs/digraph_generators.py b/sage/graphs/digraph_generators.py`
 a 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. `Wikipedia article on the De Bruijn graph `_ For more information, see the `Wikipedia article on De Bruijn graph `_. INPUT:
• ## sage/graphs/generic_graph.py

`diff --git a/sage/graphs/generic_graph.py b/sage/graphs/generic_graph.py`