# Ticket #8786: trac_8786-other_fixes.patch

File trac_8786-other_fixes.patch, 7.5 KB (added by ncohen, 11 years ago)
• ## sage/graphs/digraph.py

```# HG changeset patch
# User Nathann Cohen <nathann.cohen@gmail.com>
# Date 1272441720 -7200
# Node ID 6ff8b2af66e4189292d67f9e0dbb02197c9d749f
# Parent  eab8e5597dd105ff5ae2d8ec0df2889d89dcb5fc

diff -r eab8e5597dd1 -r 6ff8b2af66e4 sage/graphs/digraph.py```
 a 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 `_ One can very easily create a directed graph in Sage by typing:: 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 `_. INPUT : 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 `_. INPUT :
• ## sage/graphs/digraph_generators.py

`diff -r eab8e5597dd1 -r 6ff8b2af66e4 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. ( more information on this page : http://en.wikipedia.org/wiki/De_Bruijn_graph ) `Wikipedia article on the De Bruijn graph `_ INPUT:
• ## sage/graphs/generic_graph.py

`diff -r eab8e5597dd1 -r 6ff8b2af66e4 sage/graphs/generic_graph.py`