Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

sage.graphs: fix doctest warnings due to modularization #36077

Merged
merged 2 commits into from
Aug 13, 2023
Merged

sage.graphs: fix doctest warnings due to modularization #36077

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
b304a64
fix doctest warnings in sage.graphs
dcoudert Aug 11, 2023
0670be0
use block level tag
dcoudert Aug 11, 2023
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
7 changes: 4 additions & 3 deletions src/sage/graphs/base/static_sparse_graph.pyx
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -1032,15 +1032,16 @@ def spectral_radius(G, prec=1e-10):

A larger example::

sage: # needs sage.modules
sage: G = DiGraph()
sage: G.add_edges((i,i+1) for i in range(200))
sage: G.add_edge(200,0)
sage: G.add_edge(1,0)
sage: e_min, e_max = spectral_radius(G, 0.00001)
sage: p = G.adjacency_matrix(sparse=True).charpoly() # needs sage.modules
sage: p # needs sage.modules
sage: p = G.adjacency_matrix(sparse=True).charpoly()
sage: p
x^201 - x^199 - 1
sage: r = p.roots(AA, multiplicities=False)[0] # needs sage.modules
sage: r = p.roots(AA, multiplicities=False)[0]
sage: e_min < r < e_max
True

Expand Down
4 changes: 2 additions & 2 deletions src/sage/graphs/generators/distance_regular.pyx
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -1755,8 +1755,8 @@ def _line_graph_generalised_polygon(H):
EXAMPLES::

sage: # needs sage.libs.gap
sage: from sage.graphs.generators.distance_regular import \
....: _line_graph_generalised_polygon
sage: from sage.graphs.generators.distance_regular import (
....: _line_graph_generalised_polygon)
sage: G = graphs.GeneralisedHexagonGraph(1, 8)
sage: H = _line_graph_generalised_polygon(G)
sage: H.is_distance_regular(True)
Expand Down
6 changes: 3 additions & 3 deletions src/sage/graphs/generators/families.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -3937,12 +3937,12 @@ def MathonPseudocyclicStronglyRegularGraph(t, G=None, L=None):
[-4 -3 -2 2 3 4 -1 0 1]
[-2 -4 -3 4 2 3 1 -1 0]

sage: # needs sage.modules sage.rings.finite_rings
sage: # needs sage.modules sage.rings.finite_rings sage.groups sage.libs.gap
sage: G.relabel(range(9))
sage: G3x3 = graphs.MathonPseudocyclicStronglyRegularGraph(2, G=G, L=L) # needs sage.groups sage.libs.gap
sage: G3x3 = graphs.MathonPseudocyclicStronglyRegularGraph(2, G=G, L=L)
sage: G3x3.is_strongly_regular(parameters=True)
(441, 220, 109, 110)
sage: G3x3.automorphism_group(algorithm="bliss").order() # optional - bliss
sage: G3x3.automorphism_group(algorithm="bliss").order() # optional - bliss
27
sage: G9 = graphs.MathonPseudocyclicStronglyRegularGraph(2)
sage: G9.is_strongly_regular(parameters=True)
Expand Down
18 changes: 10 additions & 8 deletions src/sage/graphs/graph_decompositions/tdlib.pyx
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -125,10 +125,11 @@ def treedecomposition_exact(G, lb=-1):

EXAMPLES::

sage: import sage.graphs.graph_decompositions.tdlib as tdlib # optional - tdlib
sage: G = graphs.HouseGraph() # optional - tdlib
sage: T = tdlib.treedecomposition_exact(G) # optional - tdlib
sage: T.show(vertex_size=2000) # optional - tdlib
sage: # optional - tdlib
sage: import sage.graphs.graph_decompositions.tdlib as tdlib
sage: G = graphs.HouseGraph()
sage: T = tdlib.treedecomposition_exact(G)
sage: T.show(vertex_size=2000)

TESTS::

Expand Down Expand Up @@ -176,10 +177,11 @@ def get_width(T):

EXAMPLES::

sage: import sage.graphs.graph_decompositions.tdlib as tdlib # optional - tdlib
sage: G = graphs.PetersenGraph() # optional - tdlib
sage: T = tdlib.treedecomposition_exact(G) # optional - tdlib
sage: tdlib.get_width(T) # optional - tdlib
sage: # optional - tdlib
sage: import sage.graphs.graph_decompositions.tdlib as tdlib
sage: G = graphs.PetersenGraph()
sage: T = tdlib.treedecomposition_exact(G)
sage: tdlib.get_width(T)
4
"""
return (max(len(x) for x in T) - 1) if T else -1