Opened 4 years ago

Closed 4 years ago

# py3: strengthen a doctest in vertex_separation.pyx

Reported by: Owned by: David Coudert major sage-8.7 graph theory py3, graph David Coudert Frédéric Chapoton N/A 42dc1a5 42dc1a54b65323cd86bdf83f2dc353d4320c32e8

### Description

The order in which solutions are found by the branch and bound algorithm depends on the order in which vertices are visited. Hence, this test sometimes answers 10 and some other times 11, and both answers are correct.

```sage: from sage.graphs.graph_decompositions import vertex_separation as VS
sage: G = graphs.MycielskiGraph(5)
sage: vs, seq = VS.vertex_separation_BAB(G, cut_off=11); vs
10 or 11
```

We change it to a robust form

```sage: VS.vertex_separation_BAB(G, cut_off=11)[0] <= 11
True
```

### comment:1 Changed 4 years ago by David Coudert

Branch: → u/dcoudert/27242_vertex_separation → 42dc1a54b65323cd86bdf83f2dc353d4320c32e8 new → needs_review

New commits:

 ​42dc1a5 `trac #27242: strengthen doctests`

### comment:2 Changed 4 years ago by Frédéric Chapoton

Reviewers: → Frédéric Chapoton needs_review → positive_review

ok

### comment:3 Changed 4 years ago by Volker Braun

Branch: u/dcoudert/27242_vertex_separation → 42dc1a54b65323cd86bdf83f2dc353d4320c32e8 → fixed positive_review → closed
Note: See TracTickets for help on using tickets.