                      :characters characters})))
 
 
-(def SparseGraph->FlatGraph (comp CountedAndMarkedGraph->FlatGraph
+(def SparseGraph->FlatGraph (comp OrderedGraph->FlatGraph
                                   best-ordering
                                   SparseGraph->ordered-graphs))

               0)))


(defn count-and-mark-crossings
  "Step 5 of ESK, counts the number of crossings that result from a bi-layer
  ordering. Implements the algorithm found in Bilayer Cross Counting, by
  Wilhelm Barth, Petra Mutzel and Michael Jünger

           :layers (vec (rseq layers)))))

(defrecord OrderedLayer [id duration items])

(defrecord FlatGraph [layers succs preds aboves belows top-idxs bot-idxs
                      crossings marked characters]
