     (add-edge g last-n node characters)))
 
 
-(defn- process-characters
+(defn process-characters
   "Process each set of characters, where a set is defined as those characters
   present in the current node that also share their last node (ie. they define
   an edge in the graph)"

  (map->Segment (assoc edge :layer-id layer-id)))


(defn- add-edge [graph last-node node characters]
  "Creates an edge and adds it to the graph as a whole and to each participating node"
  (let [weight (count characters)
        forward-edge (Edge. node characters weight)

    [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"
