Skip to content

Commit f32ef0f

Browse files
committed
fixed RST215 error
1 parent f2a5abe commit f32ef0f

File tree

1 file changed

+8
-8
lines changed

1 file changed

+8
-8
lines changed

src/sage/graphs/matching_covered_graph.py

Lines changed: 8 additions & 8 deletions
Original file line numberDiff line numberDiff line change
@@ -2769,14 +2769,14 @@ def is_brick(self, coNP_certificate=False):
27692769
3. a list of set of vertices of one of the shores of those respective
27702770
nontrivial tight cuts.
27712771
2772-
i. In case of nontrivial barrier cuts, each of the shores is a
2773-
nontrivial odd component wrt a nontrivial barrier, thus the
2774-
returned list forms mutually exclusive collection of (odd)
2775-
sets.
2776-
2777-
ii. Otherwise each of the nontrivial tight cuts is a 2-separation
2778-
cut, each of the shores form a subset sequence, with the `i`th
2779-
shore being a proper subset of the `i + 1`th shore.
2772+
- In case of nontrivial barrier cuts, each of the shores is a
2773+
nontrivial odd component wrt a nontrivial barrier, thus the
2774+
returned list forms mutually exclusive collection of (odd)
2775+
sets.
2776+
2777+
- Otherwise each of the nontrivial tight cuts is a 2-separation
2778+
cut, each of the shores form a subset sequence, with the `i`th
2779+
shore being a proper subset of the `i + 1`th shore.
27802780
27812781
4. a string showing whether the nontrivial tight cuts are barrier
27822782
cuts (if the string is 'nontrivial barrier cuts'), or 2-separation

0 commit comments

Comments
 (0)