@@ -193,8 +193,8 @@ cdef class dancing_linksWrapper:
193
193
r """
194
194
Reinitialization of the search algorithm
195
195
196
- This recreates an empty `dancing_links` object and adds the rows to
197
- the instance of dancing_links.
196
+ This recreates an empty `` dancing_links` ` object and adds the rows to
197
+ the instance of `` dancing_links. ``
198
198
199
199
EXAMPLES::
200
200
@@ -805,7 +805,7 @@ cdef class dancing_linksWrapper:
805
805
INPUT:
806
806
807
807
- ``ncpus`` -- integer ( default: ``None``) , maximal number of
808
- subprocesses to use at the same time. If `ncpus>1` the dancing
808
+ subprocesses to use at the same time. If `` ncpus>1` ` the dancing
809
809
links problem is split into independent subproblems to allow
810
810
parallel computation. If ``None``, it detects the number of
811
811
effective CPUs in the system using
@@ -968,8 +968,8 @@ cdef class dancing_linksWrapper:
968
968
969
969
.. NOTE::
970
970
971
- When comparing the time taken by method `one_solution`,
972
- have in mind that `one_solution_using_sat_solver` first
971
+ When comparing the time taken by method `` one_solution` `,
972
+ have in mind that `` one_solution_using_sat_solver` ` first
973
973
creates the SAT solver instance from the dancing links
974
974
solver. This copy of data may take many seconds depending on
975
975
the size of the problem.
@@ -1096,8 +1096,8 @@ cdef class dancing_linksWrapper:
1096
1096
1097
1097
.. NOTE::
1098
1098
1099
- When comparing the time taken by method `one_solution`, have in
1100
- mind that `one_solution_using_milp_solver` first creates ( and
1099
+ When comparing the time taken by method `` one_solution` `, have in
1100
+ mind that `` one_solution_using_milp_solver` ` first creates ( and
1101
1101
caches) the MILP solver instance from the dancing links solver.
1102
1102
This copy of data may take many seconds depending on the size
1103
1103
of the problem.
0 commit comments