id,summary,reporter,owner,description,type,status,priority,milestone,component,resolution,keywords,cc,merged,author,reviewer,upstream,work_issues,branch,commit,dependencies,stopgaps
27151,py3: fix doctests in vertex_separation.pyx,dcoudert,,"Several failing doctests were caused by the impossibility to sort of list of `Set` (already in Python2).
{{{
sage: from sage.graphs.graph_decompositions.vertex_separation import vertex_separation, linear_ordering_to_path_decomposition
sage: g = graphs.PathGraph(5)
sage: pw, L = vertex_separation(g, algorithm=""BAB""); pw
1
sage: h = linear_ordering_to_path_decomposition(g, L)
sage: sorted(h)
[{0, 1}, {3, 4}, {2, 3}, {1, 2}]
}}}
Since path decomposition is a graph whose vertices are `Set`, we get different results in py2 and py3.
=> we mark doctests as `# py2` and `# py3`.
Some doctests were due to a `max(None, )`. With a proper initialization of the `cut_off` variable, we don't have this issue anymore.
Another doctest is fixed in #27027.",enhancement,closed,major,sage-8.7,graph theory,fixed,"py3, graph",,,David Coudert,Vincent Klein,N/A,,206f49653a806520e465c8102c7b5e848f592a92,206f49653a806520e465c8102c7b5e848f592a92,,