 
 ;; simulation invocation point
 
-(defn standard-simulator-sets
-  "Implements a standard simulator set algorithm by using
-  schematic-simulator-sets for small graphs (i.e. base-set smaller
-  than 1000 elements) and efficient-simulator-sets for larger ones."
-  [G-1 G-2]
-  (if (< (max (count (vertices G-1))
-              (count (vertices G-2)))
-         1000)
-    (efficient-simulator-sets G-1 G-2)
-    (schematic-simulator-sets G-1 G-2)))
-
-(defvar *simulator-set-algorithm* standard-simulator-sets
+(defvar *simulator-set-algorithm* efficient-simulator-sets
   "Algorithm to use when computing simulator sets between two description graphs.")
 
 (defn simulates?

               (rest vertex-set)))
      {:base-set (vertices G),
       :labels   (vertex-labels G),
       :post     (fn [v r]
                   (set-of w [[s w] ((neighbours G) v)
                              :when (= s r)])),
       :pre      (fn [v r]

              (set-of w [w (:base-set G-2),
                         :let [post-w ((:post G-2) w r)]
                         :when (and (not (empty? post-w))
                                    (empty? (intersection (.get sim v) post-w)))]))))
    (doseq [w (:base-set G-2)]
      (.put pre* w
            (set-of [u r] [r R, u ((:pre G-2) w r)])))
