                                  "implicit" :implicit
 
                                  "cut" :cut  ;;unsupported ;; compute also minimal cut?
-                                 "full" :full ;; full graph: for testing etc.
+                                 "full" :full ;; full, random graph: for testing etc.
+                                 "random" :random ;; full, random: takes num of vertices as argument
                                  "help" :help
                                  "version" :version
                                  }

  (:require [clojure.edn :as edn])
  (:gen-class))

(def __gecf-version__ "0.0.1")

#_ "
basic code structure:

     (take-while #(not= % eof) (repeatedly #(read input false eof))))))


(defn read-pairs [] (read-all))
(defn read-simple [] (map vec (partition 2 (read-all))))


(defn compute-print [print-cut? g]
