py3: fix some doctests in French book (graph and programming)

[chapoton]

New commits:

​2f24d0b

py3: fix some doctests in French book

[dcoudert]

The proposed patch fixes some doctests, but I also see this error.

File "src/sage/tests/books/computational-mathematics-with-sagemath/graphtheory_doctest.py", line 386, in sage.tests.books.computational-mathematics-with-sagemath.graphtheory_doctest
Failed example:
    for i in tasks:
      print("t{} assigned to {}".format(i,M.neighbors('t'+str(i))[0]))
Expected:
    t0 assigned to w2
    t1 assigned to w3
    t2 assigned to w5
    t3 assigned to w8
    t4 assigned to w1
    t5 assigned to w7
    t6 assigned to w9
    t7 assigned to w0
    t8 assigned to w4
    t9 assigned to w6
Got:
    t0 assigned to w3
    t1 assigned to w9
    t2 assigned to w5
    t3 assigned to w0
    t4 assigned to w1
    t5 assigned to w2
    t6 assigned to w8
    t7 assigned to w7
    t8 assigned to w4
    t9 assigned to w6

Do you want to solve it it or to postpone it for another ticket ?

[chapoton]

postpone

[dcoudert]

So then, LGTM.

[embray]

What's up with this?

@@ -280,8 +280,11 @@ Sage example in ./graphtheory.tex, line 1736::
 Sage example in ./graphtheory.tex, line 1746::
 
   sage: P = Permutations(range(g.order()))
-  sage: n_colors, coloration = min(
-  ....:    greedy_coloring(g, P.random_element()) for i in range(50))
+  sage: n_colors = g.order()
+  sage: for i in range(50):
+  ....:     n_col, coloration = greedy_coloring(g, P.random_element())
+  ....:     if n_col < n_colors:
+  ....:         n_colors = n_col
   sage: n_colors
   4

It's not clear to me why the old code wouldn't work on Python 3. In any case this is an ugly way to write min(...) so I would rather just skip this test if for some reason it doesn't work as a 1-liner.

Please in the future CC me on changes to these tests.

[chapoton]

this was comparing also the second argument "coloration" with itself, which is a dict..

[embray]

​min() takes a key argument much like sorted so you can take the min while comparing just n_colors like min(..., key=lambda c: c[0]), for example.

[git]

Branch pushed to git repo; I updated commit sha1. This was a forced push. New commits:

​c8a1ab4

py3: fix some doctests in French book

[chapoton]

done, thx for the suggestion

[git]

Branch pushed to git repo; I updated commit sha1. This was a forced push. New commits:

​a4e1bed

py3: fix some doctests in French book

[chapoton]

and the bot is now green

[dcoudert]

Right, it's much better like that.

[embray]

+1 Thank you!