Minor typos in 6.9

[jmantysalo]

This is a container ticket for minor documentation typos found in version 6.9, to be fixed for 6.10. I'll add them here, if I am not doing another ticket for same part of Sage. Of course others can also make additions to this.

• coding_in_python.rst, links in "experimental" part broken.✓
• sage.rings.rational.integer_rational_power, output section. ✓

• linear_extensions.html, broken link in first SEEALSO block. ✓
• frank_network() on posets, x \ge y should be p \ge q.✓

• graphs.py, part "generators": somehow add a mention about graphs() there, like we now have graphs(n). Add link to common graphs page.✓

digraphs:

• is_directed_acyclic, too much indentation on output block ✓
• level_sets, too much indentation on output block ✓
• reverse_edges, vertical spacing in input block. ✓

in combinat/interval_posets (and elsewhere):

wrong formatting ,`` in the first lines of from_binary_trees and from_dyck_words ✓

[jmantysalo]

Darij: Can you confirm that in frank_network() "for each p and q in P such that x≥y, an edge from (0,p) to (1,q)." should be "for each p and q in P such that p≥q, an edge from (0,p) to (1,q)."

[darij]

Confirmed. Good catch!

[chapoton]

New commits:

​e8ddba6

trac #19534 remove bad instances of ,``

[git]

Branch pushed to git repo; I updated commit sha1. New commits:

​61e2c90

trac #19534 doc cleanup for digraphs

[git]

Branch pushed to git repo; I updated commit sha1. New commits:

​57813c9

trac #19354 correction of frank network

[git]

Branch pushed to git repo; I updated commit sha1. New commits:

​5a6d106

trac #19354 correct output in rational.pyx

[jmantysalo]

Frédéric, how we know when 6.10 is going out, i.e. when to close this?

[git]

Branch pushed to git repo; I updated commit sha1. New commits:

​c139ef9

trac #19354 doc in linear extensions

[git]

Branch pushed to git repo; I updated commit sha1. New commits:

​10df38b

trac #19354 links in coding in python

[chapoton]

Please correct the last topic, so that we can close this ticket now, and open a new one. No need to wait for 6.10.

[git]

Branch pushed to git repo; I updated commit sha1. New commits:

​9cb0d40

Added an example of graphs() iterator.

[jmantysalo]

As you wish. But I guess I won't review this until monday.

Example of graphs() is kind of artificial. But better examples take more time, and maybe are not better for showing how to use this.

[git]

Branch pushed to git repo; I updated commit sha1. New commits:

​7f996b4

trac #19354 new style doc-test continuation please

[chapoton]

ok, looks good to me now. Jori, please double check and set to positive review if you agree

[jmantysalo]

• A 3-tuple (`g`, ``rw``, ``signs``) misses a pair of ` around g.

• is_directed_acyclic on digraph.py, still too much indentation on output, see part "When certificate=True".

Otherwise I found no problems.

[chapoton]

Replying to jmantysalo:

• A 3-tuple (`g`, ``rw``, ``signs``) misses a pair of ` around g.

No, this is written `g` in the whole doc of the function, let us rather keep that.

• is_directed_acyclic on digraph.py, still too much indentation on output, see part "When certificate=True".

I do not understand. How much indentation do you want ? 0 ?

[jmantysalo]

Replying to chapoton:

• A 3-tuple (`g`, ``rw``, ``signs``) misses a pair of ` around g.

No, this is written `g` in the whole doc of the function, let us rather keep that.

OK.

• is_directed_acyclic on digraph.py, still too much indentation on output, see part "When certificate=True".

I do not understand. How much indentation do you want ? 0 ?

There is

        * When ``certificate=True``:

            * If the graph is acyclic, returns a pair ``(True, ordering)``
              where ``ordering`` is a list of the vertices such that ``u``
              appears before ``v`` in ``ordering`` if ``u, v`` is an edge.

and I think that it should be

        * When ``certificate=True``:

          * If the graph is acyclic, returns a pair ``(True, ordering)``
            where ``ordering`` is a list of the vertices such that ``u``
            appears before ``v`` in ``ordering`` if ``u, v`` is an edge.

I.e. 2 spaces less, and so one level less in indentation.

[git]

Branch pushed to git repo; I updated commit sha1. New commits:

​9807c4a

trac #19354 shift by 2 instead of 4

[jmantysalo]

No more complains.

[jmantysalo]

Almost forgot. I put Frédéric also as reviewer, as he read my example on graphs() iterator.

[vbraun]

Merge conflict, try again with the next beta

[git]

Branch pushed to git repo; I updated commit sha1. New commits:

​9185acb

Merge branch 'minor_typos' into minor_typos_6_9

[jmantysalo]

On is_directed_acyclic() at digraph.py I changed "When certificate=True :" to "When certificate=True:", i.e. removed a space. Now this merges.