                (inc exp))))))
 
 
-(defn- single-edge-super-crossings
+(defn single-edge-super-crossings
   "Counts the number of crossings that result from adding an edge, in order,
   to the accumulator tree. If the index is even, meaning it's a right
   child of its parent, we increment its value. If the index is

    [g r-node]))


(defn- process-edge-characters [graph last-node node characters]
  "Create edges and possibly new helper nodes for a set of characters that
  remain together from last-node to node"
  (let [span (- (:layer-id node) (:layer-id last-node))

    [g q-node]))


(defn add-r-node [graph last-node node characters]
  "R nodes are created to assist in drawing the graph, when an edge skips over a layer.
  In that case, the r node is placed in the intervening layer, and an edge is created
  from last-node to r node"
