Skip to content

Commit c1674f0

Browse files
committed
addiing blanklines between </dl> and the examples in docstrings
1 parent 4abc682 commit c1674f0

File tree

4 files changed

+5
-0
lines changed

4 files changed

+5
-0
lines changed

pymathics/graph/base.py

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1448,6 +1448,7 @@ class VertexIndex(_NetworkXBuiltin):
14481448
<dd> gives the integer index of the vertex 'v' in the\
14491449
graph 'g'.
14501450
</dl>
1451+
14511452
>> a=.;
14521453
>> VertexIndex[{c <-> d, d <-> a}, a]
14531454
= 3

pymathics/graph/components.py

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -71,6 +71,7 @@ def eval(
7171
# <dt>'FindHamiltonianPath[$g$]'
7272
# <dd>returns a Hamiltonian path in the given tournament graph.
7373
# </dl>
74+
#
7475
# """
7576
# def eval_(self, graph, expression, evaluation: Evaluation, options):
7677
# "FindHamiltonianPath[graph_, OptionsPattern[FindHamiltonPath]]"

pymathics/graph/parametric.py

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -469,6 +469,7 @@ class KaryTree(_NetworkXBuiltin):
469469
<dt>'KaryTree[$n$, $k$]'
470470
<dd>Creates $k$-ary tree with $n$ vertices.
471471
</dl>
472+
472473
>> KaryTree[10]
473474
= -Graph-
474475
@@ -552,6 +553,7 @@ class PathGraph(_NetworkXBuiltin):
552553
<dd>Returns a Graph with a path with vertices $v_i$ and \
553554
edges between $v-i$ and $v_i+1$ .
554555
</dl>
556+
555557
>> PathGraph[{1, 2, 3}]
556558
= -Graph-
557559
"""

pymathics/graph/structured.py

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -21,6 +21,7 @@ class PathGraph(_NetworkXBuiltin):
2121
<dt>'PathGraph[{$v_1$, $v_2$, ...}]'
2222
<dd>Returns a Graph with a path with vertices $v_i$ and edges between $v-i$ and $v_i+1$ .
2323
</dl>
24+
2425
>> PathGraph[{1, 2, 3}]
2526
= -Graph-
2627
"""

0 commit comments

Comments
 (0)