update algorithm description

Author: dragoncoder047

algorithm.md

@@ -2,16 +2,14 @@
 
 Everything is based on a `Grid` that contains all the data for the document. This `Grid` can be masked to show something else instead of the original, and restored to the original.
 
-The algorithm first starts by finding all the "large component" boxes in the grid. After that, it finds all the "small component" reference designators. Then it picks out the BOM notes so component values, etc. can be drawn.
+The algorithm first starts by finding all the "large component" boxes in the grid. After that, it finds all the "small component" reference designators. Then it picks out the BOM notes so component values, etc. can be included.
 
 Once it has all the components picked out, it runs around the bounding boxes of each component and collects the flags, which are characters adjacent to the component but not the usual `|` and `-` for wires (these are masked out with normal wires.)
 
-Next, wires are mapped out with a flood fill algorithm and drawn, one `<g>` per wire.
+Next, wires are mapped out with a tree-walking search algorithm, hopping between corners (which is either breadth-first or depth-first, depending on whether I left the 0 in the `frontier.pop()`) and each group of wires is drawn and placed in a `<g class="wire">`.
 
-Then for each designator, the terminals are dispatched to the function to generate the SVG path of the component, returning its own `<g>` that can be styled.
+Then for each designator, the terminals and bounding boxes are dispatched to a function to generate the SVG path of the component, and it is wrapped in a `<g class="component">` that can be styled.
 
-***--- IMPLEMENTATION LIMIT OF CURRENT CODE... more coming soon ---***
+All of the `<g>`'s are then concatenated together and wrapped in an enclosing `<svg>` element.
 
-All of the `<g>`'s are concatenated together and wrapped in an enclosing `<svg>` element.
-
-That's pretty much it.
+That's pretty much it. The CSS does all the rest.

schemascii/utils.py

@@ -79,8 +79,9 @@ def iterate_line(p1: complex, p2: complex, step: float = 1.) -> GeneratorType:
 
 
 def deep_transform(data, origin: complex, theta: float):
-    """Transform the point first by translating by origin,
-    then rotating by theta."""
+    """Transform the point or points first by translating by origin,
+    then rotating by theta. Returns an identical data structure,
+    but with the transformed points substituted."""
     if isinstance(data, list | tuple):
         return [deep_transform(d, origin, theta) for d in data]
     if isinstance(data, complex):