passagemath-repl 10.5.28__py3-none-any.whl → 10.5.30__py3-none-any.whl

sage/tests/books/computational-mathematics-with-sagemath/graphique_doctest.py

@@ -0,0 +1,255 @@
+# sage_setup: distribution = sagemath-repl
+# sage.doctest: needs sage.plot sage.symbolic
+"""
+This file (./graphique_doctest.sage) was *autogenerated* from ./graphique.tex,
+with sagetex.sty version 2011/05/27 v2.3.1.
+It contains the contents of all the sageexample environments from this file.
+You should be able to doctest this file with:
+sage -t ./graphique_doctest.sage
+It is always safe to delete this file; it is not used in typesetting your
+document.
+
+Sage example in ./graphique.tex, line 18::
+
+  sage: reset()
+
+Sage example in ./graphique.tex, line 61::
+
+  sage: plot(x * sin(1/x), x, -2, 2, plot_points=500)
+  Graphics object consisting of 1 graphics primitive
+
+Sage example in ./graphique.tex, line 156::
+
+  sage: def p(x, n):
+  ....:     return(taylor(sin(x), x, 0, n))
+  sage: xmax = 15 ; n = 15
+  sage: g = plot(sin(x), x, -xmax, xmax)
+  sage: for d in range(n):  # long time
+  ....:   g += plot(p(x, 2 * d + 1), x, -xmax, xmax,\
+  ....:     color=(1.7*d/(2*n), 1.5*d/(2*n), 1-3*d/(4*n)))
+  sage: g.show(ymin=-2, ymax=2)
+
+Sage example in ./graphique.tex, line 237::
+
+  sage: f2(x) = 1; f1(x) = -1
+  sage: f = piecewise([[(-pi,0),f1],[(0,pi),f2]])
+  sage: S = f.fourier_series_partial_sum(20,pi)
+  sage: g = plot(S, x, -8, 8, color='blue')
+  sage: saw(x) = x - 2 * pi * floor((x + pi) / (2 * pi))
+  sage: g += plot(saw(x) / abs(saw(x)), x, -8, 8, color='red')
+  sage: g
+  Graphics object consisting of 2 graphics primitives
+
+Sage example in ./graphique.tex, line 311::
+
+  sage: t = var('t')
+  sage: x = cos(t) + cos(7*t)/2 + sin(17*t)/3
+  sage: y = sin(t) + sin(7*t)/2 + cos(17*t)/3
+  sage: g = parametric_plot((x, y), (t, 0, 2*pi))
+  sage: g.show(aspect_ratio=1)
+
+Sage example in ./graphique.tex, line 364::
+
+  sage: t = var('t'); n = 20/19
+  sage: g1 = polar_plot(1+2*cos(n*t),(t,0,n*36*pi),plot_points=5000)
+  sage: g2 = polar_plot(1+1/3*cos(n*t),(t,0,n*36*pi),plot_points=5000)
+  sage: g1.show(aspect_ratio=1); g2.show(aspect_ratio=1)
+
+Sage example in ./graphique.tex, line 500::
+
+  sage: bar_chart([randrange(15) for i in range(20)])
+  Graphics object consisting of 1 graphics primitive
+  sage: bar_chart([x^2 for x in range(1,20)], width=0.2)
+  Graphics object consisting of 1 graphics primitive
+
+Sage example in ./graphique.tex, line 550::
+
+  sage: liste = [10 + floor(10*sin(i)) for i in range(100)]
+  sage: bar_chart(liste)
+  Graphics object consisting of 1 graphics primitive
+  sage: TimeSeries(liste).plot_histogram(bins=20)
+  Graphics object consisting of 20 graphics primitives
+
+Sage example in ./graphique.tex, line 714::
+
+  sage: n, l, x, y = 10000, 1, 0, 0; p = [[0, 0]]
+  sage: for k in range(n):
+  ....:     theta = (2 * pi * random()).n(digits=5)
+  ....:     x, y = x + l * cos(theta), y + l * sin(theta)
+  ....:     p.append([x, y])
+  sage: g1 = line([p[n], [0, 0]], color='red', thickness=2)
+  sage: g1 += line(p, thickness=.4); g1.show(aspect_ratio=1)
+
+Sage example in ./graphique.tex, line 777::
+
+  sage: length = 200; n = var('n')
+  sage: u = lambda n: n * sqrt(2)
+  sage: z = lambda n: exp(2 * I * pi * u(n)).n()
+  sage: vertices = [CC(0, 0)]
+  sage: for n in range(1, length):
+  ....:     vertices.append(vertices[n - 1] + CC(z(n)))
+  sage: line(vertices).show(aspect_ratio=1)
+
+Sage example in ./graphique.tex, line 968::
+
+  sage: x = var('x'); y = function('y')
+  sage: DE = x*diff(y(x), x) == 2*y(x) + x^3
+  sage: desolve(DE, [y(x),x])
+  (_C + x)*x^2
+  sage: sol = []
+  sage: for i in srange(-2, 2, 0.2):
+  ....:     sol.append(desolve(DE, [y(x), x], ics=[1, i]))
+  ....:     sol.append(desolve(DE, [y(x), x], ics=[-1, i]))
+  sage: g = plot(sol, x, -2, 2)
+  sage: y = var('y')
+  sage: g += plot_vector_field((x, 2*y+x^3), (x,-2,2), (y,-1,1))
+  sage: g.show(ymin=-1, ymax=1)
+
+Sage example in ./graphique.tex, line 1029::
+
+  sage: x = var('x'); y = function('y')
+  sage: DE = x*diff(y(x), x) == 2*y(x) + x^3
+  sage: g = Graphics()             # creates an empty graph
+  sage: for i in srange(-2, 2, 0.2):  # long time
+  ....:     g += line(desolve_rk4(DE, y(x), ics=[1, i],\
+  ....:                       step=0.05, end_points=[0,2]))
+  ....:     g += line(desolve_rk4(DE, y(x), ics=[-1, i],\
+  ....:                       step=0.05, end_points=[-2,0]))
+  sage: y = var('y')
+  sage: g += plot_vector_field((x, 2*y+x^3), (x,-2,2), (y,-1,1))
+  sage: g.show(ymin=-1, ymax=1)
+
+Sage example in ./graphique.tex, line 1120::
+
+  sage: import scipy; from scipy import integrate
+  sage: f = lambda y, t: - cos(y * t)
+  sage: t = srange(0, 5, 0.1); p = Graphics()
+  sage: for k in srange(0, 10, 0.15):
+  ....:       y = integrate.odeint(f, k, t)
+  ....:       p += line(zip(t, flatten(y.tolist())))
+  sage: t = srange(0, -5, -0.1); q = Graphics()
+  sage: for k in srange(0, 10, 0.15):
+  ....:       y = integrate.odeint(f, k, t)
+  ....:       q += line(zip(t, flatten(y.tolist())))
+  sage: y = var('y')
+  sage: v = plot_vector_field((1, -cos(x*y)), (x,-5,5), (y,-2,11))
+  sage: g = p + q + v; g.show()
+
+Sage example in ./graphique.tex, line 1229::
+
+  sage: import scipy; from scipy import integrate
+  sage: a, b, c, d = 1., 0.1, 1.5, 0.75
+  sage: def dX_dt(X, t=0):             # returns the population variation
+  ....:     return [a*X[0] - b*X[0]*X[1], -c*X[1] + d*b*X[0]*X[1]]
+  sage: t = srange(0, 15, .01)                               # time scale
+  sage: X0 = [10, 5]         # initial conditions: 10 rabbits and 5 foxes
+  sage: X = integrate.odeint(dX_dt, X0, t)           # numerical solution
+  sage: rabbits, foxes =  X.T                # shortcut for X.transpose()
+  sage: p = line(zip(t, rabbits), color='red')  # number of rabbits graph
+  sage: p += text("Rabbits",(12,37), fontsize=10, color='red')
+  sage: p += line(zip(t, foxes), color='blue')           # idem for foxes
+  sage: p += text("Foxes",(12,7), fontsize=10, color='blue')
+  sage: p.axes_labels(["time", "population"]); p.show(gridlines=True)
+
+Sage example in ./graphique.tex, line 1266::
+
+  sage: n = 11;  L = srange(6, 18, 12 / n); R = srange(3, 9, 6 / n)
+  sage: CI = list(zip(L, R))           # list of initial conditions
+  sage: def g(x, y):
+  ....:     v = vector(dX_dt([x, y]))  # for a nicer graph, we
+  ....:     return v/v.norm()          # normalise the vector field
+  sage: x, y = var('x, y')
+  sage: q = plot_vector_field(g(x, y), (x, 0, 60), (y, 0, 36))
+  sage: for j in range(n):
+  ....:     X = integrate.odeint(dX_dt, CI[j], t)        # resolution
+  ....:     q += line(X, color=hue(.8-float(j)/(1.8*n))) # graph plot
+  sage: q.axes_labels(["rabbits","foxes"]); q.show()
+
+Sage example in ./graphique.tex, line 1501::
+
+  sage: x, y, t = var('x, y, t')
+  sage: alpha(t) = 1; beta(t) = t / 2; gamma(t) = t + t^3 / 8
+  sage: env = solve([alpha(t) * x + beta(t) * y == gamma(t),\
+  ....:     diff(alpha(t), t) * x + diff(beta(t), t) * y == \
+  ....:     diff(gamma(t), t)], [x,y])
+
+Sage example in ./graphique.tex, line 1541::
+
+  sage: f(x) = x^2 / 4
+  sage: p = plot(f, -8, 8, rgbcolor=(0.2,0.2,0.4))  # the parabola
+  sage: for u in srange(0, 8, 0.1):      # normals to the parabola
+  ....:    p += line([[u, f(u)], [-8*u, f(u) + 18]], thickness=.3)
+  ....:    p += line([[-u, f(u)], [8*u, f(u) + 18]], thickness=.3)
+  sage: p += parametric_plot((env[0][0].rhs(),env[0][1].rhs()),\
+  ....:    (t, -8, 8),color='red')             # draws the evolute
+  sage: p.show(xmin=-8, xmax=8, ymin=-1, ymax=12, aspect_ratio=1)
+
+Sage example in ./graphique.tex, line 1604::
+
+  sage: t = var('t'); p = 2
+  sage: x(t) = t; y(t) = t^2 / (2 * p); f(t) = [x(t), y(t)]
+  sage: df(t) = [x(t).diff(t), y(t).diff(t)]
+  sage: d2f(t) = [x(t).diff(t, 2), y(t).diff(t, 2)]
+  sage: T(t) = [df(t)[0] / df(t).norm(), df[1](t) / df(t).norm()]
+  sage: N(t) = [-df(t)[1] / df(t).norm(), df[0](t) / df(t).norm()]
+  sage: R(t) = (df(t).norm())^3 / (df(t)[0]*d2f(t)[1]-df(t)[1]*d2f(t)[0])
+  sage: Omega(t) = [f(t)[0] + R(t)*N(t)[0], f(t)[1] + R(t)*N(t)[1]]
+  sage: g = parametric_plot(f(t), (t,-8,8), color='green',thickness=2)
+  sage: for u in srange(.4, 4, .2):
+  ....:     g += line([f(t=u), Omega(t=u)], color='red', alpha = .5)
+  ....:     g += circle(Omega(t=u), R(t=u), color='blue')
+  sage: g.show(aspect_ratio=1,xmin=-12,xmax=7,ymin=-3,ymax=12)
+
+Sage example in ./graphique.tex, line 1781::
+
+  sage: u, v = var('u, v')
+  sage: h = lambda u,v: u^2 + 2*v^2
+  sage: plot3d(h, (u,-1,1), (v,-1,1), aspect_ratio=[1,1,1])
+  Graphics3d Object
+
+Sage example in ./graphique.tex, line 1833. Sometimes the result
+needs to be simplified to obtain a nice short expression::
+
+  sage: f(x, y) = x^2 * y / (x^4 + y^2)
+  sage: t, theta = var('t, theta')
+  sage: result = limit(f(t * cos(theta), t * sin(theta)) / t, t=0)
+  sage: result.full_simplify()
+  cos(theta)^2/sin(theta)
+
+Sage example in ./graphique.tex, line 1847::
+
+  sage: solve(f(x,y) == 1/2, y)
+  [y == x^2]
+  sage: a = var('a'); h = f(x, a*x^2).simplify_rational(); h
+  a/(a^2 + 1)
+
+Sage example in ./graphique.tex, line 1861::
+
+  sage: plot(h, a, -4, 4)
+  Graphics object consisting of 1 graphics primitive
+
+Sage example in ./graphique.tex, line 1908::
+
+  sage: p = plot3d(f(x,y),(x,-2,2),(y,-2,2),plot_points=[150,150])
+
+Sage example in ./graphique.tex, line 1937::
+
+  sage: for i in range(1,4):
+  ....:  p += plot3d(-0.5 + i / 4, (x, -2, 2), (y, -2, 2),\
+  ....:               color=hue(i / 10), opacity=.1)
+
+Sage example in ./graphique.tex, line 1956::
+
+  sage: x, y, z = var('x, y, z'); a = 1
+  sage: h = lambda x, y, z:(a^2 + x^2 + y^2)^2 - 4*a^2*x^2-z^4
+  sage: implicit_plot3d(h, (x,-3,3), (y,-3,3), (z,-2,2),  # long time
+  ....:                 plot_points=100)
+  Graphics3d Object
+
+Sage example in ./graphique.tex, line 2004::
+
+  sage: line3d([(-10*cos(t)-2*cos(5*t)+15*sin(2*t),\
+  ....:          -15*cos(2*t)+10*sin(t)-2*sin(5*t),\
+  ....:          10*cos(3*t)) for t in srange(0,6.4,.1)],radius=.5)
+  Graphics3d Object
+"""

sage/tests/books/computational-mathematics-with-sagemath/graphtheory_doctest.py

@@ -0,0 +1,419 @@
+# sage_setup: distribution = sagemath-repl
+# sage.doctest: needs sage.graphs sage.numerical.mip
+"""
+This file (./graphtheory_doctest.sage) was *autogenerated* from ./graphtheory.tex,
+with sagetex.sty version 2011/05/27 v2.3.1.
+It contains the contents of all the sageexample environments from this file.
+You should be able to doctest this file with:
+sage -t ./graphtheory_doctest.sage
+It is always safe to delete this file; it is not used in typesetting your
+document.
+
+Sage example in ./graphtheory.tex, line 12::
+
+  sage: set_random_seed(1588)
+  sage: sage.numerical.backends.generic_backend.default_solver = "Glpk"
+
+Sage example in ./graphtheory.tex, line 59::
+
+  sage: g = Graph()
+
+Sage example in ./graphtheory.tex, line 87::
+
+  sage: g.order(), g.size()
+  (0, 0)
+  sage: g.add_vertex(0)
+  sage: g.order(), g.size()
+  (1, 0)
+  sage: g.add_vertices([1, 2, 5, 9])
+  sage: g.order(), g.size()
+  (5, 0)
+  sage: g.add_edges([(1,5), (9,2), (2,5), (1,9)])
+  sage: g.order(), g.size()
+  (5, 4)
+  sage: g.add_edge("Madrid", "Edinburgh")
+  sage: g.order(), g.size()
+  (7, 5)
+
+Sage example in ./graphtheory.tex, line 128::
+
+  sage: g.delete_vertex(0)
+  sage: g.delete_edges([(1,5), (2,5)])
+  sage: g.order(), g.size()
+  (6, 3)
+  sage: sorted(g.vertices(sort=False), key=str)
+  [1, 2, 5, 9, 'Edinburgh', 'Madrid']
+  sage: sorted(g.edges(sort=False, labels=False), key=str)
+  [('Edinburgh', 'Madrid'), (1, 9), (2, 9)]
+
+Sage example in ./graphtheory.tex, line 159::
+
+  sage: g = Graph({
+  ....:      0: [],
+  ....:      1: [5, 9],
+  ....:      2: [1, 5, 9],
+  ....:      'Edinburgh': ['Madrid']})
+
+Sage example in ./graphtheory.tex, line 212::
+
+  sage: P = graphs.PetersenGraph()
+  sage: C = graphs.ChvatalGraph()
+
+Sage example in ./graphtheory.tex, line 252::
+
+  sage: P = graphs.PetersenGraph()
+  sage: P.is_planar()
+  False
+  sage: P.minor(graphs.CompleteBipartiteGraph(3,3))  # random
+  {0: [1], 1: [8], 2: [4], 3: [6, 7, 9], 4: [2, 3], 5: [0, 5]}
+  sage: P.minor(graphs.CompleteGraph(5))  # random
+  {0: [1, 6], 1: [0, 5], 2: [2, 7], 3: [4, 9], 4: [3, 8]}
+  sage: P.girth()
+  5
+  sage: P.is_regular(3)
+  True
+  sage: P.chromatic_number()
+  3
+  sage: P.is_vertex_transitive()
+  True
+  sage: P.show()
+
+Sage example in ./graphtheory.tex, line 332::
+
+  sage: K = graphs.KneserGraph(5, 2); P = graphs.PetersenGraph()
+  sage: K.is_isomorphic(P)
+  True
+
+Sage example in ./graphtheory.tex, line 340::
+
+  sage: all( graphs.KneserGraph(n,k).chromatic_number() == n - 2*k + 2
+  ....:      for n in range(5, 9) for k in range(2, n // 2) )
+  True
+
+Sage example in ./graphtheory.tex, line 459::
+
+  sage: H = graphs.ClawGraph()
+  sage: def test():
+  ....:    g = graphs.RandomGNP(20,2/5)
+  ....:    return not g.subgraph_search(H, induced=True) is None
+  sage: sum( test() for i in range(100) ) >= 80
+  True
+
+Sage example in ./graphtheory.tex, line 485::
+
+  sage: P = graphs.PetersenGraph()
+  sage: H = graphs.HoffmanSingletonGraph()
+  sage: U = P + H; U2 = P.disjoint_union(H)
+  sage: U.is_isomorphic(U2)
+  True
+
+Sage example in ./graphtheory.tex, line 496::
+
+  sage: C = graphs.ChvatalGraph()
+  sage: U = 3 * C; U2 = C.disjoint_union(C.disjoint_union(C))
+  sage: U2.is_isomorphic(U)
+  True
+
+Sage example in ./graphtheory.tex, line 506::
+
+  sage: U = 3*P + 2*C
+
+Sage example in ./graphtheory.tex, line 513::
+
+  sage: all( (CC.is_isomorphic(P) or CC.is_isomorphic(C))
+  ....:       for CC in U.connected_components_subgraphs() )
+  True
+
+Sage example in ./graphtheory.tex, line 522::
+
+  sage: sum( CC.is_isomorphic(P)
+  ....:      for CC in U.connected_components_subgraphs() )
+  3
+  sage: sum( CC.is_isomorphic(C)
+  ....:      for CC in U.connected_components_subgraphs() )
+  2
+
+Sage example in ./graphtheory.tex, line 568::
+
+  sage: C = graphs.ChvatalGraph(); C.show()
+
+Sage example in ./graphtheory.tex, line 583::
+
+  sage: C.show(partition = [C.independent_set()])
+
+Sage example in ./graphtheory.tex, line 597::
+
+  sage: C.show(vertex_colors = {
+  ....:   "red" : [0, 1, 2],    "blue" : [3, 4, 5],
+  ....:   "yellow" : [6, 7, 8], "purple" : [9, 10, 11]})
+
+Sage example in ./graphtheory.tex, line 608::
+
+  sage: C.coloring(hex_colors = True)
+  {'#00ffff': [3, 8, 5],
+     '#7f00ff': [11],
+     '#7fff00': [1, 4, 6, 9],
+     '#ff0000': [0, 2, 7, 10]}
+  sage: C.show(vertex_colors = C.coloring(hex_colors = True))
+
+Sage example in ./graphtheory.tex, line 644::
+
+  sage: L = [graphs.CompleteGraph(i) for i in range(3,3+10)]
+  sage: for number, G in enumerate(L):
+  ....:     G.plot().save(tmp_filename(ext='.png'))
+
+Sage example in ./graphtheory.tex, line 782::
+
+  sage: P5 = graphs.PathGraph(5); House = graphs.HouseGraph()
+  sage: P5.complement().is_isomorphic(House)
+  True
+  sage: P4 = graphs.PathGraph(4); P4.complement().is_isomorphic(P4)
+  True
+  sage: C5 = graphs.CycleGraph(5); C5.complement().is_isomorphic(C5)
+  True
+
+Sage example in ./graphtheory.tex, line 852::
+
+  sage: n = 5; Path = graphs.PathGraph(n)
+  sage: Grid = Path.cartesian_product(Path)
+  sage: Grid.is_isomorphic(graphs.GridGraph([n,n]))
+  True
+
+Sage example in ./graphtheory.tex, line 1144::
+
+  sage: n = 30; p = 0.3; trials = 50
+  sage: def equality(G):
+  ....:     return G.edge_connectivity() == min(G.degree())
+  sage: sum(equality(graphs.RandomGNP(n,p)) for i in range(trials))/trials
+  1
+
+Sage example in ./graphtheory.tex, line 1319::
+
+  sage: g = graphs.ChvatalGraph(); cycle = g.hamiltonian_cycle()
+  sage: g.show(vertex_labels = False); cycle.show(vertex_labels = False)
+
+Sage example in ./graphtheory.tex, line 1586::
+
+  sage: set_random_seed(3291)
+
+Sage example in ./graphtheory.tex, line 1589::
+
+  sage: n = 100; p = 5/n; g = graphs.RandomGNP(n, p)
+
+Sage example in ./graphtheory.tex, line 1597::
+
+  sage: # Set of available colors.
+  sage: # In the worst-case scenario up to n colors suffice
+  sage: available_colors = Set(range(n))
+
+Sage example in ./graphtheory.tex, line 1611::
+
+  sage: # This dictionary contains the color associated
+  sage: # with each vertex of the graph
+  sage: color = {}
+  sage: for u in g:
+  ....:    forbidden = Set([color[v] for v in g.neighbors(u)
+  ....:                              if v in color])
+  ....:    color[u] = min(available_colors - forbidden)
+
+Sage example in ./graphtheory.tex, line 1625::
+
+  sage: # Number of colors used
+  sage: max(color.values()) + 1
+  5
+
+Sage example in ./graphtheory.tex, line 1635::
+
+  sage: P = Permutations([0,1,2,3]); P.random_element()
+  [3, 2, 1, 0]
+
+Sage example in ./graphtheory.tex, line 1646::
+
+  sage: available_colors = Set(range(n))
+
+Sage example in ./graphtheory.tex, line 1656::
+
+  sage: n_tests = 30
+  sage: vertices = g.vertices(sort=False)
+  sage: P = Permutations(range(n))
+  sage: best_coloring = {}
+  sage: best_chromatic_number = +oo
+
+Sage example in ./graphtheory.tex, line 1678::
+
+  sage: for t in range(n_tests):
+  ....:    # Random ordering of vertices
+  ....:    p = P.random_element()
+  ....:    color = {}
+  ....:    for i in range(g.order()):
+  ....:          u = vertices[p[i]]
+  ....:          forbidden = Set([color[v] for v in g.neighbors(u)
+  ....:                      if v in color])
+  ....:          color[u] = min(available_colors - forbidden)
+  ....:    # Update the best coloring
+  ....:    if max(color.values()) + 1 < best_chromatic_number:
+  ....:          best_coloring = color
+  ....:          best_chromatic_number = 1 + max(color.values())
+
+Sage example in ./graphtheory.tex, line 1697::
+
+  sage: best_chromatic_number # Number of colors used
+  5
+
+Sage example in ./graphtheory.tex, line 1718::
+
+  sage: def greedy_coloring(g, permutation):
+  ....:     n = g.order()
+  ....:     available_colors = Set(range(n))
+  ....:     vertices = g.vertices(sort=False)
+  ....:     color = {}
+  ....:     for i in range(n):
+  ....:         u = vertices[permutation[i]]
+  ....:         forbidden = Set([color[v] for v in g.neighbors(u)
+  ....:                         if v in color])
+  ....:         color[u] = min(available_colors - forbidden)
+  ....:     return max(color.values()) + 1, color
+
+Sage example in ./graphtheory.tex, line 1736::
+
+  sage: set_random_seed(0)
+
+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)], key=lambda c: c[0])
+  sage: n_colors
+  5
+
+Sage example in ./graphtheory.tex, line 1782::
+
+  sage: n = 20; k = 4; g = graphs.RandomGNP(n, 0.5)
+  sage: g = g.subgraph(edges = g.min_spanning_tree())
+
+Sage example in ./graphtheory.tex, line 1786::
+
+  sage: while True:
+  ....:    _, edges, [S,Sb] = g.edge_connectivity(vertices = True)
+  ....:    cardinality = len(edges)
+  ....:    if cardinality < k:
+  ....:         CP = cartesian_product([S, Sb])
+  ....:         g.add_edges([CP.random_element()
+  ....:                      for i in range(k - len(edges))])
+  ....:    else:
+  ....:         break
+
+Sage example in ./graphtheory.tex, line 1844::
+
+  sage: g = graphs.RandomGNP(40, 0.4)
+  sage: P = Permutations(range(g.order()))
+  sage: mean = sum( 1/(g.degree(v)+1) for v in g )
+
+Sage example in ./graphtheory.tex, line 1849::
+
+  sage: while True:
+  ....:    n = P.random_element()
+  ....:    S = [v for v in g if all( n[v] < n[u] for u in g.neighbors(v))]
+  ....:    if len(S) >= mean:
+  ....:        break
+
+Sage example in ./graphtheory.tex, line 1989::
+
+  sage: def find_induced(H, G):
+  ....:  # the function from V(H) to V(G) we aim to define:
+  ....:  f = {}
+  ....:  # set of vertices of G not yet used by f:
+  ....:  G_remain = G.vertices(sort=False)
+  ....:  # set of vertices having no representative yet:
+  ....:  H_remain = H.vertices(sort=False)
+  ....:  # while the function is not complete:
+  ....:  while H_remain:
+  ....:      v = H_remain.pop(0) # look for the next vertex of H
+  ....:      # and its potential images in G
+  ....:      candidates = [u for u in G_remain
+  ....:                    if all(H.has_edge(h,v) == G.has_edge(f_h,u)
+  ....:                           for h, f_h in f.items())]
+  ....:      # if no candidate is found, we abort immediately
+  ....:      if not candidates:
+  ....:          raise ValueError("No copy of H has been found in G")
+  ....:      # otherwise we select the first candidate
+  ....:      f[v] = candidates[0]
+  ....:      G_remain.remove(f[v])
+  ....:  return f
+
+Sage example in ./graphtheory.tex, line 2012::
+
+  sage: set_random_seed(4)
+
+Sage example in ./graphtheory.tex, line 2021::
+
+  sage: H = graphs.PetersenGraph()
+  sage: G = graphs.RandomGNP(500,0.5)
+  sage: find_induced(H,G)
+  {0: 0, 1: 1, 2: 3, 3: 13, 4: 7, 5: 62, 6: 24, 7: 232, 8: 67, 9: 45}
+
+Sage example in ./graphtheory.tex, line 2070::
+
+  sage: n = 100; V = range(n+1)
+  sage: G = Graph()
+  sage: G.add_edges([
+  ....:    (i,j) for i,j in Subsets(V,2) if is_square(abs(i-j)) ])
+
+Sage example in ./graphtheory.tex, line 2084::
+
+  sage: X = G.independent_set(); X  # random with python3
+  [4, 6, 9, 11, 16, 21, 23, 26, 28, 33, 38, 43, 50,
+  56, 61, 71, 76, 78, 83, 88, 93, 95, 98, 100]
+  sage: G.is_independent_set(X)
+  True
+
+Sage example in ./graphtheory.tex, line 2139::
+
+  sage: tasks = {0: [2, 5, 3, 7], 1: [0, 1, 4],
+  ....:   2: [5, 0, 4],           3: [0, 1],
+  ....:   4: [8],                 5: [2],
+  ....:   6: [8, 9, 7],           7: [5, 8, 7],
+  ....:   8: [2, 5, 3, 6, 4],     9: [2, 5, 8, 6, 1]}
+  sage: G = Graph()
+  sage: for i in tasks:
+  ....:   G.add_edges(("w" + str(i), "t" + str(j)) for j in tasks[i])
+
+Sage example in ./graphtheory.tex, line 2182::
+
+  sage: M = Graph(G.matching())
+  sage: txt = "t{} assigned to {}"
+  sage: for i in tasks:                                        # random
+  ....:     print(txt.format(i, M.neighbors('t' + str(i))[0])) # random
+  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
+
+Sage example in ./graphtheory.tex, line 2232::
+
+  sage: n = 10
+  sage: G = graphs.CompleteGraph(n)
+  sage: from sage.graphs.graph_coloring import edge_coloring
+  sage: for day, matches in enumerate(edge_coloring(G)):
+  ....:    print("Matches of day {}: {}".format(day, matches))
+  Matches of day 0: [(0, 9), (1, 8), (2, 7), (3, 6), (4, 5)]
+  Matches of day 1: [(0, 2), (1, 9), (3, 8), (4, 7), (5, 6)]
+  Matches of day 2: [(0, 4), (1, 3), (2, 9), (5, 8), (6, 7)]
+  Matches of day 3: [(0, 6), (1, 5), (2, 4), (3, 9), (7, 8)]
+  Matches of day 4: [(0, 8), (1, 7), (2, 6), (3, 5), (4, 9)]
+  Matches of day 5: [(0, 1), (2, 8), (3, 7), (4, 6), (5, 9)]
+  Matches of day 6: [(0, 3), (1, 2), (4, 8), (5, 7), (6, 9)]
+  Matches of day 7: [(0, 5), (1, 4), (2, 3), (6, 8), (7, 9)]
+  Matches of day 8: [(0, 7), (1, 6), (2, 5), (3, 4), (8, 9)]
+
+Sage example in ./graphtheory.tex, line 2260::
+
+  sage: g = graphs.CompleteGraph(10)
+  sage: g.show(edge_colors=edge_coloring(g, hex_colors=True))
+"""