knit-graphs 0.0.10__py3-none-any.whl → 0.0.11__py3-none-any.whl

knit_graphs/Loop.py

@@ -3,6 +3,7 @@
 This module defines the Loop class which represents individual loops in a knitting pattern.
 Loops are the fundamental building blocks of knitted structures and maintain relationships with parent loops, yarn connections, and float positions.
 """
+
 from __future__ import annotations
 
 from typing import TYPE_CHECKING
@@ -225,7 +226,7 @@ class Loop:
         """
         return self.loop_id
 
-    def __eq__(self, other: Loop) -> bool:
+    def __eq__(self, other: object) -> bool:
         """Check equality with another base loop based on loop_id and type.
 
         Args:
@@ -234,7 +235,7 @@ class Loop:
         Returns:
             bool: True if both loops have the same class and loop_id, False otherwise.
         """
-        return isinstance(other, other.__class__) and self.loop_id == other.loop_id
+        return isinstance(other, Loop) and isinstance(other, other.__class__) and self.loop_id == other.loop_id
 
     def __lt__(self, other: Loop | int) -> bool:
         """Compare loop_id with another loop or integer for ordering.

knit_graphs/Pull_Direction.py

@@ -2,6 +2,7 @@
 
 This module defines the Pull_Direction enumeration which represents the two ways a loop can be pulled through other loops in knitting: from back to front (knit) or from front to back (purl).
 """
+
 from __future__ import annotations
 
 from enum import Enum
@@ -13,6 +14,7 @@ class Pull_Direction(Enum):
     This enumeration represents the two directions that yarn can be pulled through loops to create different stitch types.
     BtF (Back to Front) creates knit stitches, while FtB (Front to Back) creates purl stitches.
     """
+
     BtF = "Knit"
     FtB = "Purl"
 

knit_graphs/Yarn.py

@@ -3,10 +3,12 @@
 This module contains the Yarn class and Yarn_Properties dataclass which together represent the physical yarn used in knitting patterns.
 The Yarn class manages the sequence of loops along a yarn and their floating relationships.
 """
+
 from __future__ import annotations
 
+from collections.abc import Iterator
 from dataclasses import dataclass
-from typing import TYPE_CHECKING, Iterator, cast
+from typing import TYPE_CHECKING, cast
 
 from networkx import DiGraph, dfs_edges, dfs_preorder_nodes
 
@@ -22,6 +24,7 @@ class Yarn_Properties:
 
     This frozen dataclass contains all the physical and visual properties that characterize a yarn, including its structure, weight, and appearance.
     """
+
     name: str = "yarn"  # name (str): The name or identifier for this yarn type.
     plies: int = 2  # plies (int): The number of individual strands twisted together to form the yarn.
     weight: float = 28  # weight (float): The weight category or thickness of the yarn.
@@ -52,7 +55,7 @@ class Yarn_Properties:
         """
         return Yarn_Properties()
 
-    def __eq__(self, other: Yarn_Properties) -> bool:
+    def __eq__(self, other: object) -> bool:
         """Check equality with another Yarn_Properties instance.
 
         Args:
@@ -61,7 +64,13 @@ class Yarn_Properties:
         Returns:
             bool: True if all properties (name, plies, weight, color) are equal, False otherwise.
         """
-        return self.name == other.name and self.plies == other.plies and self.weight == other.weight and self.color == other.color
+        return (
+            isinstance(other, Yarn_Properties)
+            and self.name == other.name
+            and self.plies == other.plies
+            and self.weight == other.weight
+            and self.color == other.color
+        )
 
     def __hash__(self) -> int:
         """Get hash value for use in sets and dictionaries.
@@ -82,10 +91,15 @@ class Yarn:
         loop_graph (DiGraph): The directed graph loops connected by yarn-wise float edges.
         properties (Yarn_Properties): The physical and visual properties of this yarn.
     """
+
     FRONT_LOOPS: str = "Front_Loops"
     _BACK_LOOPS: str = "Back_Loops"
 
-    def __init__(self, yarn_properties: None | Yarn_Properties = None, knit_graph: None | Knit_Graph = None):
+    def __init__(
+        self,
+        yarn_properties: None | Yarn_Properties = None,
+        knit_graph: None | Knit_Graph = None,
+    ):
         """Initialize a yarn with the specified properties and optional knit graph association.
 
         Args:
@@ -304,7 +318,7 @@ class Yarn:
             KeyError: The given loop does not exist in the yarn.
         """
         if loop not in self:
-            raise KeyError(f'Loop {loop} does not exist on yarn {self}.')
+            raise KeyError(f"Loop {loop} does not exist on yarn {self}.")
         prior_loop = self.prior_loop(loop)
         next_loop = self.next_loop(loop)
         if isinstance(prior_loop, Loop) and isinstance(next_loop, Loop):  # Loop is between two floats to be merged.
@@ -313,7 +327,12 @@ class Yarn:
             back_of_float_loops = self.get_loops_behind_float(prior_loop, loop)
             back_of_float_loops.update(self.get_loops_behind_float(loop, next_loop))
             self.loop_graph.remove_node(loop)
-            self.loop_graph.add_edge(prior_loop, next_loop, Front_Loops=front_of_float_loops, Back_Loops=back_of_float_loops)
+            self.loop_graph.add_edge(
+                prior_loop,
+                next_loop,
+                Front_Loops=front_of_float_loops,
+                Back_Loops=back_of_float_loops,
+            )
             for front_loop in front_of_float_loops:
                 front_loop.add_loop_in_front_of_float(prior_loop, next_loop)
             for back_loop in back_of_float_loops:
@@ -433,8 +452,11 @@ class Yarn:
             list[tuple[Loop, Loop, set[Loop]]]: List of tuples containing the two loops defining each float and the set of loops positioned in front of that float.
             Only includes floats that have loops in front of them.
         """
-        return [(u, v, self.get_loops_in_front_of_float(u, v)) for u, v in self.edge_iter()
-                if len(self.get_loops_in_front_of_float(u, v)) > 0]
+        return [
+            (u, v, self.get_loops_in_front_of_float(u, v))
+            for u, v in self.edge_iter()
+            if len(self.get_loops_in_front_of_float(u, v)) > 0
+        ]
 
     def loops_behind_floats(self) -> list[tuple[Loop, Loop, set[Loop]]]:
         """Get all float segments with loops positioned behind them.
@@ -443,8 +465,11 @@ class Yarn:
             list[tuple[Loop, Loop, set[Loop]]]: List of tuples containing the two loops defining each float and the set of loops positioned behind that float.
             Only includes floats that have loops behind them.
         """
-        return [(u, v, self.get_loops_behind_float(u, v)) for u, v in self.edge_iter()
-                if len(self.get_loops_behind_float(u, v)) > 0]
+        return [
+            (u, v, self.get_loops_behind_float(u, v))
+            for u, v in self.edge_iter()
+            if len(self.get_loops_behind_float(u, v)) > 0
+        ]
 
     def __getitem__(self, item: int) -> Loop:
         """Get a loop by its ID from this yarn.

knit_graphs/artin_wale_braids/Crossing_Direction.py

@@ -2,6 +2,7 @@
 
 This module defines the Crossing_Direction enumeration which represents the different ways loops can cross over or under each other in cable knitting patterns.
 """
+
 from __future__ import annotations
 
 from enum import Enum
@@ -13,6 +14,7 @@ class Crossing_Direction(Enum):
     This enumeration represents the three possible crossing relationships between loops: crossing over to the right, crossing under to the right, or no crossing at all.
     These directions are fundamental to representing cable structures in knitted fabrics.
     """
+
     Over_Right = "+"
     Under_Right = "-"
     No_Cross = "|"

knit_graphs/artin_wale_braids/Loop_Braid_Graph.py

@@ -2,6 +2,7 @@
 
 This module provides the Loop_Braid_Graph class which tracks crossing relationships between loops in cable knitting patterns using a directed graph structure.
 """
+
 from typing import cast
 
 from networkx import DiGraph
@@ -19,6 +20,7 @@ class Loop_Braid_Graph:
     Attributes:
         loop_crossing_graph (DiGraph): A NetworkX directed graph storing loop crossing relationships with crossing direction attributes.
     """
+
     _CROSSING = "crossing"
 
     def __init__(self) -> None:
@@ -70,8 +72,11 @@ class Loop_Braid_Graph:
         if left_loop not in self:
             return []
         else:
-            return [rl for rl in self.loop_crossing_graph.successors(left_loop)
-                    if self.get_crossing(left_loop, rl) is not Crossing_Direction.No_Cross]
+            return [
+                rl
+                for rl in self.loop_crossing_graph.successors(left_loop)
+                if self.get_crossing(left_loop, rl) is not Crossing_Direction.No_Cross
+            ]
 
     def right_crossing_loops(self, right_loop: Loop) -> list[Loop]:
         """Get all loops that cross with the given loop when it is on the right side.
@@ -85,8 +90,11 @@ class Loop_Braid_Graph:
         if right_loop not in self:
             return []
         else:
-            return [l for l in self.loop_crossing_graph.predecessors(right_loop)
-                    if self.get_crossing(l, right_loop) is not Crossing_Direction.No_Cross]
+            return [
+                l
+                for l in self.loop_crossing_graph.predecessors(right_loop)
+                if self.get_crossing(l, right_loop) is not Crossing_Direction.No_Cross
+            ]
 
     def get_crossing(self, left_loop: Loop, right_loop: Loop) -> Crossing_Direction:
         """Get the crossing direction between two loops, creating a no-cross edge if none exists.
@@ -102,4 +110,7 @@ class Loop_Braid_Graph:
         """
         if not self.loop_crossing_graph.has_edge(left_loop, right_loop):
             self.add_crossing(left_loop, right_loop, Crossing_Direction.No_Cross)
-        return cast(Crossing_Direction, self.loop_crossing_graph[left_loop][right_loop][self._CROSSING])
+        return cast(
+            Crossing_Direction,
+            self.loop_crossing_graph[left_loop][right_loop][self._CROSSING],
+        )

knit_graphs/artin_wale_braids/Wale.py

@@ -2,9 +2,11 @@
 
 This module defines the Wale class which represents a vertical column of stitches in a knitted structure, maintaining the sequence and relationships between loops in that column.
 """
+
 from __future__ import annotations
 
-from typing import TYPE_CHECKING, Iterator, cast
+from collections.abc import Iterator
+from typing import TYPE_CHECKING, cast
 
 from networkx import DiGraph, dfs_preorder_nodes
 
@@ -26,6 +28,7 @@ class Wale:
         last_loop (Loop | None): The last (top) loop in the wale sequence.
         stitches (DiGraph): Stores the directed graph of stitch connections within this wale.
     """
+
     _PULL_DIRECTION: str = "pull_direction"
 
     def __init__(self, first_loop: Loop, knit_graph: Knit_Graph, end_loop: Loop | None = None) -> None:
@@ -60,7 +63,11 @@ class Wale:
         Args:
             loop (Loop): The loop to add to the end of the wale.
         """
-        self.stitches.add_edge(self.last_loop, loop, pull_direction=self._knit_graph.get_pull_direction(self.last_loop, loop))
+        self.stitches.add_edge(
+            self.last_loop,
+            loop,
+            pull_direction=self._knit_graph.get_pull_direction(self.last_loop, loop),
+        )
         self.last_loop = loop
 
     def get_stitch_pull_direction(self, u: Loop, v: Loop) -> Pull_Direction:
@@ -91,12 +98,14 @@ class Wale:
                 * The second wale (from split_loop to end). This will be None if the split_loop is not found.
         """
         if split_loop in self:
-            return (Wale(self.first_loop, self._knit_graph, end_loop=split_loop),
-                    Wale(split_loop, self._knit_graph, end_loop=self.last_loop))
+            return (
+                Wale(self.first_loop, self._knit_graph, end_loop=split_loop),
+                Wale(split_loop, self._knit_graph, end_loop=self.last_loop),
+            )
         else:
             return self, None
 
-    def __eq__(self, other: Wale) -> bool:
+    def __eq__(self, other: object) -> bool:
         """
         Args:
             other (Wale): The wale to compare.
@@ -104,9 +113,9 @@ class Wale:
         Returns:
             bool: True if all the loops in both wales are present and in the same order. False, otherwise.
         """
-        if len(self) != len(other):
+        if not isinstance(other, Wale) or len(self) != len(other):
             return False
-        return not any(l != o for l, o in zip(self, other))
+        return not any(l != o for l, o in zip(self, other, strict=False))
 
     def __len__(self) -> int:
         """Get the number of loops in this wale.

knit_graphs/artin_wale_braids/Wale_Braid.py

@@ -3,6 +3,7 @@
 This module provides the Wale_Braid class which represents complex cable knitting patterns as mathematical braid structures,
 using concepts from algebraic topology to model how wales cross over and under each other.
 """
+
 from knit_graphs.artin_wale_braids.Wale_Braid_Word import Wale_Braid_Word
 from knit_graphs.artin_wale_braids.Wale_Group import Wale_Group
 

knit_graphs/artin_wale_braids/Wale_Braid_Word.py

@@ -2,6 +2,7 @@
 
 This module provides the Wale_Braid_Word class which represents a single step in a braid operation, describing how loops cross over each other within a course of knitting.
 """
+
 from __future__ import annotations
 
 from knit_graphs.artin_wale_braids.Crossing_Direction import Crossing_Direction
@@ -59,7 +60,7 @@ class Wale_Braid_Word:
         new_crossings = {i: ~c for i, c in self.crossings.items()}
         return Wale_Braid_Word(new_loops, new_crossings)
 
-    def __eq__(self, other: Wale_Braid_Word) -> bool:
+    def __eq__(self, other: object) -> bool:
         """Check equality with another wale braid word.
 
         Two braid words are equal if they have the same loops in the same order and the same crossing operations at the same indices.
@@ -70,13 +71,13 @@ class Wale_Braid_Word:
         Returns:
             bool: True if both braid words have identical loops, loop ordering, and crossing operations, False otherwise.
         """
-        if (len(self) != len(other)
-                or any(l != o for l, o in zip(self.loops, other.loops))
-                or any(i not in other.crossings for i in self.crossings)
-                or any(other.crossings[i] != cd for i, cd in self.crossings.items())):
-            return False
-        else:
-            return True
+        return (
+            isinstance(other, Wale_Braid_Word)
+            and len(self) == len(other)
+            and all(l == o for l, o in zip(self.loops, other.loops, strict=False))
+            and all(i in other.crossings for i in self.crossings)
+            and all(other.crossings[i] == cd for i, cd in self.crossings.items())
+        )
 
     def is_inversion(self, other: Wale_Braid_Word) -> bool:
         """Check if another braid word is the inverse of this braid word.

knit_graphs/artin_wale_braids/Wale_Group.py

@@ -2,6 +2,7 @@
 
 This module provides the Wale_Group class which represents a collection of interconnected wales that are joined through decrease operations, forming a tree-like structure of vertical stitch columns.
 """
+
 from __future__ import annotations
 
 from typing import TYPE_CHECKING, cast
@@ -57,14 +58,16 @@ class Wale_Group:
         for wale in full_wales:
             u_loops: list[Loop] = cast(list[Loop], wale[:-1])
             v_loops: list[Loop] = cast(list[Loop], wale[1:])
-            for u, v in zip(u_loops, v_loops):
+            for u, v in zip(u_loops, v_loops, strict=False):
                 self.stitch_graph.add_edge(u, v, pull_direction=self._knit_graph.get_pull_direction(u, v))
         wales_to_split = full_wales
         while len(wales_to_split) > 0:
             wale_to_split = wales_to_split.pop()
             split = False
             upper_loops = cast(list[Loop], wale_to_split[1:])
-            for loop in upper_loops:  # skip first loop in each wale as it may be already connected to a discovered decrease.
+            for (
+                loop
+            ) in upper_loops:  # skip first loop in each wale as it may be already connected to a discovered decrease.
                 if len(loop.parent_loops) > 1:  # Focal of a decrease.
                     clean_wale, remaining_wale = wale_to_split.split_wale(loop)
                     if not self.wale_graph.has_node(clean_wale):
@@ -75,7 +78,7 @@ class Wale_Group:
                     break
             if not split:
                 self._add_wale(wale_to_split)
-        for bot_loop, lower_wale in self.bottom_loops.items():
+        for _bot_loop, lower_wale in self.bottom_loops.items():
             if lower_wale.last_loop in self.bottom_loops:
                 self.wale_graph.add_edge(lower_wale, self.bottom_loops[lower_wale.last_loop])
 
@@ -111,7 +114,7 @@ class Wale_Group:
             int: The height of the wale group from the base loops to the tallest terminal, measured in total number of loops.
         """
         max_len = 0
-        for bot_loop, wale in self.bottom_loops.items():
+        for _bot_loop, wale in self.bottom_loops.items():
             path_len = sum(len(successor) for successor in dfs_preorder_nodes(self.wale_graph, wale))
             max_len = max(max_len, path_len)
         return max_len
@@ -131,7 +134,7 @@ class Wale_Group:
         Returns:
             bool: True if the given loop, loop_id (int), or wale is in this group.
         """
-        if isinstance(item, Loop) or isinstance(item, int):
+        if isinstance(item, (Loop, int)):
             return item in self.stitch_graph.nodes
         else:  # isinstance(item, Wale):
             return item in self.wale_graph

knit_graphs/basic_knit_graph_generators.py

@@ -3,6 +3,7 @@
 This module provides utility functions for creating common knitting patterns and structures as knit graphs.
 These functions serve as building blocks for testing and demonstration purposes.
 """
+
 from knit_graphs.artin_wale_braids.Crossing_Direction import Crossing_Direction
 from knit_graphs.Knit_Graph import Knit_Graph
 from knit_graphs.Loop import Loop
@@ -69,15 +70,19 @@ def jersey_tube(tube_width: int, height: int) -> Knit_Graph:
         """Internal helper function to set up float connections between front and back of tube."""
         front_loops = last_course[0:tube_width]
         back_loops = last_course[tube_width:]
-        for first_front, second_front, back in zip(front_loops[0:-1], front_loops[1:], reversed(back_loops)):
+        for first_front, second_front, back in zip(
+            front_loops[0:-1], front_loops[1:], reversed(back_loops), strict=False
+        ):
             yarn.add_loop_behind_float(back, first_front, second_front)
-        for (first_back, second_back, front) in zip(back_loops[0:-1], back_loops[1:], reversed(front_loops)):
+        for first_back, second_back, front in zip(
+            back_loops[0:-1], back_loops[1:], reversed(front_loops), strict=False
+        ):
             yarn.add_loop_in_front_of_float(front, first_back, second_back)
 
     _set_tube_floats()
     for _ in range(0, height):
         next_course = [yarn.make_loop_on_end() for _p in last_course]
-        for parent_loop, child_loop in zip(last_course, next_course):
+        for parent_loop, child_loop in zip(last_course, next_course, strict=False):
             knit_graph.connect_loops(parent_loop, child_loop, pull_direction=Pull_Direction.BtF)
         last_course = next_course
         _set_tube_floats()
@@ -181,19 +186,44 @@ def lace_mesh(width: int, height: int) -> Knit_Graph:
         for i, parent_loop in enumerate(reversed(last_course)):
             child_loop = yarn.make_loop_on_end()
             if i % 3 == 0:  # Just knit every third stitch
-                knit_graph.connect_loops(parent_loop, child_loop, pull_direction=Pull_Direction.BtF, stack_position=0)
+                knit_graph.connect_loops(
+                    parent_loop,
+                    child_loop,
+                    pull_direction=Pull_Direction.BtF,
+                    stack_position=0,
+                )
             elif i % 6 == 1:  # Second of every 6 stitches (0 indexed) is yarn over before a decrease.
                 yo_parent = parent_loop
             elif i % 6 == 2:  # Third of every 6 stitches is bottom of decrease with prior yarn-over's parent
-                knit_graph.connect_loops(parent_loop, child_loop, pull_direction=Pull_Direction.BtF, stack_position=0)
+                knit_graph.connect_loops(
+                    parent_loop,
+                    child_loop,
+                    pull_direction=Pull_Direction.BtF,
+                    stack_position=0,
+                )
                 assert isinstance(yo_parent, Loop)
-                knit_graph.connect_loops(yo_parent, child_loop, pull_direction=Pull_Direction.BtF, stack_position=1)
+                knit_graph.connect_loops(
+                    yo_parent,
+                    child_loop,
+                    pull_direction=Pull_Direction.BtF,
+                    stack_position=1,
+                )
             elif i % 6 == 4:  # Fifth of every six stitches is bottom of decrease with next yarn-over's parent
-                knit_graph.connect_loops(parent_loop, child_loop, pull_direction=Pull_Direction.BtF, stack_position=0)
+                knit_graph.connect_loops(
+                    parent_loop,
+                    child_loop,
+                    pull_direction=Pull_Direction.BtF,
+                    stack_position=0,
+                )
                 prior_child = child_loop
             elif i % 6 == 5:  # The last of six stitches is the top of the prior decrease and new yarn-over
                 assert isinstance(prior_child, Loop)
-                knit_graph.connect_loops(parent_loop, prior_child, pull_direction=Pull_Direction.BtF, stack_position=1)
+                knit_graph.connect_loops(
+                    parent_loop,
+                    prior_child,
+                    pull_direction=Pull_Direction.BtF,
+                    stack_position=1,
+                )
             next_course.append(child_loop)
         last_course = next_course
         # Make a basic jersey course
@@ -226,7 +256,12 @@ def twist_cable(width: int, height: int) -> Knit_Graph:
     knit_graph, yarn = co_loops(width)
     last_course = knit_graph.get_courses()[0]
     next_course = []
-    pull_directions = [Pull_Direction.FtB, Pull_Direction.BtF, Pull_Direction.BtF, Pull_Direction.FtB]
+    pull_directions = [
+        Pull_Direction.FtB,
+        Pull_Direction.BtF,
+        Pull_Direction.BtF,
+        Pull_Direction.FtB,
+    ]
     for i, parent_loop in enumerate(reversed(last_course)):
         child_loop = yarn.make_loop_on_end()
         knit_graph.connect_loops(parent_loop, child_loop, pull_direction=pull_directions[i % 4])
@@ -244,7 +279,7 @@ def twist_cable(width: int, height: int) -> Knit_Graph:
                 child_loop = next_course[i - 1]
             knit_graph.connect_loops(parent_loop, child_loop, pull_direction=pull_directions[i % 4])
         if r % 2 == 1:  # cable row
-            for left_loop, right_loop in zip(next_course[1::4], next_course[2::4]):
+            for left_loop, right_loop in zip(next_course[1::4], next_course[2::4], strict=False):
                 knit_graph.add_crossing(left_loop, right_loop, crossing)
             crossing = ~crossing
         last_course = next_course

{knit_graphs-0.0.10.dist-info → knit_graphs-0.0.11.dist-info}/METADATA

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: knit-graphs
-Version: 0.0.10
+Version: 0.0.11
 Summary: A graph representation of knitted structures where each loop is a node and edges represent yarn and stitch relationships.
 Home-page: https://mhofmann-khoury.github.io/knit_graph/
 License: MIT
@@ -20,8 +20,9 @@ Classifier: Programming Language :: Python :: 3.11
 Classifier: Programming Language :: Python :: 3.12
 Classifier: Programming Language :: Python :: 3.13
 Classifier: Topic :: Scientific/Engineering
+Classifier: Typing :: Typed
 Requires-Dist: networkx (>=3.5)
-Requires-Dist: plotly (>=6.3.0,<7.0.0)
+Requires-Dist: plotly (>=6.3.0)
 Project-URL: Documentation, https://mhofmann-khoury.github.io/knit_graph/
 Project-URL: Repository, https://github.com/mhofmann-Khoury/knit_graph/
 Description-Content-Type: text/markdown

{knit_graphs-0.0.10.dist-info → knit_graphs-0.0.11.dist-info}/RECORD

@@ -17,25 +17,26 @@ docs/source/api/knit_graphs.artin_wale_braids.Wale_Group.rst,sha256=bAGHs3s8dW6l
 docs/source/api/knit_graphs.artin_wale_braids.rst,sha256=ESKgE9gg830yJ6w5mKuv3MHgH3tMZ-Ee2y3b-bSnU4Y,547
 docs/source/api/knit_graphs.basic_knit_graph_generators.rst,sha256=OgV2jkEMY0LfRq8v0cNhJUk3fbUOS9VcP8zRv4VBvC4,213
 docs/source/api/knit_graphs.rst,sha256=w9HIhWI8P0_gG0H_efRUMHYBtWbgCprcS9moclgM_3I,499
-docs/source/conf.py,sha256=TZK8Rz0JNgQs2J_cUhVX5_4tmMBvRdGtILJsnAnAFWo,13350
-docs/source/index.rst,sha256=D4KmCX1_d2-WrPgxSeggHHsc9-TeQwSUGYOkehRQWrw,1462
+docs/source/conf.py,sha256=qfKxtgms3gNDSoXGpOzWEDMzKJH20ovRMqTC57LkYF4,13282
+docs/source/index.rst,sha256=E82Y_wpDU2hR8w6bSt2k6ZstslCe7u63Ld6ZFgT70RY,1284
 docs/source/installation.rst,sha256=GyNRk_oXKVgOZ4KFLAgkXLwjHYzDYsx8gcokLRrS0ZI,1247
-knit_graphs/Course.py,sha256=hO768vPM0KFRsjCYsBTUgasqMzlvl0gsuSrsBX0UUSs,6280
-knit_graphs/Knit_Graph.py,sha256=tzJlHGwIboItz9jg6m6vch4UX3L8vYy2EYNmYpxStkg,12367
-knit_graphs/Knit_Graph_Visualizer.py,sha256=s2zp6Z7-ZF_52x3zTx8oQr__tQScpkGthIoWck57ykE,40227
-knit_graphs/Loop.py,sha256=zAVz4HtbfBTlihMppcF8E1wWI95bkGjcgQ69o59rdlc,9716
-knit_graphs/Pull_Direction.py,sha256=8xRLN-j7V1mExgmt3YjcJcTDa5rLedA2bF4wI8gd-DE,2334
-knit_graphs/Yarn.py,sha256=CRTFAA77_v6Z2xg1lhH6DWxRFn2HDokn_L7l_8Lxyc0,18089
+knit_graphs/Course.py,sha256=dcJvWtTYc66iiVpxtYzULDD2ttWuvuGnlahWpWs1wAY,6308
+knit_graphs/Knit_Graph.py,sha256=ys4-oeu23_8yZ8yjun-QngeiErUK0l3F8lnNlg7cB70,12442
+knit_graphs/Knit_Graph_Visualizer.py,sha256=R-iSEEq5_hDi3NLDjP0hVrArrynKUASHs7vA7MAccJg,42108
+knit_graphs/Loop.py,sha256=B1YU6bjTsGYZ8QrBZN52vg1btf7jvzeviCAH-Exrmw8,9747
+knit_graphs/Pull_Direction.py,sha256=3QW_TKEF3fb-Y7I8xDOHHTe6vCYK-ADi3_SDtqr5uSU,2336
+knit_graphs/Yarn.py,sha256=RaU0_At-V6Yk0TGgrRbsKeWJsI4WMoHkZHzUfs7txAE,18391
 knit_graphs/__init__.py,sha256=qzZAOxTqjgLkhoGnKNZwOkuYbKEyzfWKkKpKkV6lVfk,111
-knit_graphs/artin_wale_braids/Crossing_Direction.py,sha256=71ckmEFfL0s25NJb8lfYwH2zku0uM1C5X9gGM7PYC5A,2820
-knit_graphs/artin_wale_braids/Loop_Braid_Graph.py,sha256=hmZVe34V6dqfV8_JzuyIUkg2SaznyIZEpr3aDayG-PQ,4876
-knit_graphs/artin_wale_braids/Wale.py,sha256=vsM6zvTCLIBKDsX60r19KCJbl1ZGL2ZdINf7AJt0pBI,7109
-knit_graphs/artin_wale_braids/Wale_Braid.py,sha256=Ws0QmU7s63nrBKe69acDza-r-LozDyyaKVDNxQMy10Y,2662
-knit_graphs/artin_wale_braids/Wale_Braid_Word.py,sha256=4YBlVMUZkqp85r46ETQSbFVS_WrT4PsWthHmFv5Ny9M,4587
-knit_graphs/artin_wale_braids/Wale_Group.py,sha256=1RTGIbO_nmyKOBmQzoFcZNsl1sHRG9p4isoUztkI0jY,6665
+knit_graphs/artin_wale_braids/Crossing_Direction.py,sha256=qQCxgsI5L_PMY16bX7_W_C0YG2SKTVcq05RO5eNcZDA,2822
+knit_graphs/artin_wale_braids/Loop_Braid_Graph.py,sha256=A4KoqjBBw8mqvUyzXwCZcwSDDIePtUqgnVVKAWXTa-w,4997
+knit_graphs/artin_wale_braids/Wale.py,sha256=G7Uci5wkE5y7gHGK2bbTpRyswGRSWhVXFxyIUYOprlo,7259
+knit_graphs/artin_wale_braids/Wale_Braid.py,sha256=p2SsFQW6nQZTO89TtCnFSWTWkYAFDm6kykvhb9G7chg,2663
+knit_graphs/artin_wale_braids/Wale_Braid_Word.py,sha256=rY1cB_PpAfz4vFGPh2qUaLf0yNDczk2l6pgxtYA6Sqg,4593
+knit_graphs/artin_wale_braids/Wale_Group.py,sha256=Px-3yxKAUCeqI52IE6t6L2aSCFwgTTsVbN0bWdhQ518,6696
 knit_graphs/artin_wale_braids/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
-knit_graphs/basic_knit_graph_generators.py,sha256=doDH2MiXbMzGU9b3enEr3KdY8Fw90cssHi_lkts6VpY,11720
-knit_graphs-0.0.10.dist-info/LICENSE,sha256=Oazk3oiRu5ZN7b-EdYNYh0vu-I3Av2uIPQ-9L_cZ6Oo,1070
-knit_graphs-0.0.10.dist-info/METADATA,sha256=vU8ehebXJzejk8YwClxn5an0V8dhh-8yk631cvq_3Es,5194
-knit_graphs-0.0.10.dist-info/WHEEL,sha256=FMvqSimYX_P7y0a7UY-_Mc83r5zkBZsCYPm7Lr0Bsq4,88
-knit_graphs-0.0.10.dist-info/RECORD,,
+knit_graphs/basic_knit_graph_generators.py,sha256=x1zHC2PYbzkmjE40xe5_3k2vDsT749L9iufUIfC2QUw,12353
+knit_graphs/py.typed,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
+knit_graphs-0.0.11.dist-info/LICENSE,sha256=Oazk3oiRu5ZN7b-EdYNYh0vu-I3Av2uIPQ-9L_cZ6Oo,1070
+knit_graphs-0.0.11.dist-info/METADATA,sha256=I8Kkhsuu02YB0UX9W7Gzwzrq5Y9PrXmWvqo1j8JwUJA,5215
+knit_graphs-0.0.11.dist-info/WHEEL,sha256=FMvqSimYX_P7y0a7UY-_Mc83r5zkBZsCYPm7Lr0Bsq4,88
+knit_graphs-0.0.11.dist-info/RECORD,,