Skip to content

Commit 97b8821

Browse files
Fix typos in comments
1 parent 081fb8e commit 97b8821

File tree

2 files changed

+4
-4
lines changed

2 files changed

+4
-4
lines changed

spherogram_src/links/bands/__init__.py

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
"""
22
33
Submodule for doing band moves to construct ribbon concordances and
4-
seach for ribbon disks. Code orignally developed by Nathan Dunfield
4+
search for ribbon disks. Code originally developed by Nathan Dunfield
55
and Sherry Gong for their paper::
66
77
Ribbon concordances and slice obstructions: experiments and examples
@@ -12,7 +12,7 @@
1212
from . import merge_links
1313
from . import core
1414
from . import search
15-
from .core import Band
15+
from .core import Band, normalize_crossing_labels
1616
from .search import verify_ribbon_to_unknot
1717

1818

spherogram_src/links/bands/core.py

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -444,7 +444,7 @@ def add_one_band(link, band):
444444
E[i].label = crossing_label+i
445445

446446

447-
# now we add the horizonal arcs between the E[i] crossings
447+
# now we add the horizontal arcs between the E[i] crossings
448448

449449
if positive_twist:
450450
for i in range(num_twist - 1):
@@ -563,7 +563,7 @@ def min_len_bands(link, max_twists=2, max_band_len=None):
563563
# Compute the shortest path between each pair of vertices in the dual.
564564
dist, nxt = floyd_warshall(vertices, edges)
565565

566-
# Now interate over each pair of arcs in the diagram that we can
566+
# Now iterate over each pair of arcs in the diagram that we can
567567
# band together.
568568

569569
ans = []

0 commit comments

Comments
 (0)