Tournament and directed path constructors

[nathanncohen]

Implements a constructor for Tournament and directed paths. This may be useful in #14099.

CC: @dcoudert

Component: graph theory

Author: Nathann Cohen

Reviewer: David Coudert

Merged: sage-5.8.beta1

Issue created by migration from https://trac.sagemath.org/ticket/14122

[dcoudert]

comment:2

Some remarks:

• Returns the De Bruijn diraph with parameters k,n. -> Returns the De Bruijn digraph with parameters k,n.

• in both functions, the statement g = DiGraph() should be after the test on n

• Returns a tournament n vertices. -> Returns a tournament on n vertices. (twice in patch)

• for i in range(n) -> for i in range(n-1)

• d = {i:(i,0) for i in range(n)}

  g.set_pos(d)

  -> g.set_pos( {i:(i,0) for i in range(n)} )

[dcoudert]

Reviewer: David Coudert

[nathanncohen]

comment:3

Hahahaha. It all makes sense. Thank you ! :-)

Nathann

[dcoudert]

comment:4

The patch is working (install, tests, docbuild) and good to go.

[nathanncohen]

comment:5

Thaaaaaaaaaanks ! :-)

Nathann

[jdemeyer]

comment:6

The patch needs a proper commit message.

[nathanncohen]

Attachment: trac_14122.patch.gz

[nathanncohen]

comment:7

Argggggg ! I knew that I had forgotten a commit message in some ticket ! Sorryyyyyyyy ^^;

Nathann

[jdemeyer]

Merged: sage-5.8.beta1