         graph-reader (if (opt :paired) read-pairs graph-reader)
         graph-reader (if (opt :simple) read-simple graph-reader)       ;;prefered if both specified
 
-        print-cut? (get-in ac [:opts :cut])
+        print-cut? (opt :cut)
+        print-cut? (if (opt :cut-edn) :edn print-cut?)
+        print-cut? (if (opt :cut-all) :all print-cut?)
         ]
     (cond
      (opt :version) (println (get-version))

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


(defn compute-print [print-cut? g]
  (if print-cut?
    (println "Can't compute minimal cut yet.")
    (-> g min-max-flow first println)))

(defn prn-help []
  (println "Gecf : compute k-edge-conectedness of given graph

  --bidirectional  -b         consider input to be an undirected graph (default)
  --directed       -d         consider input to be a directed graph

  --pairs          -p         input consists of nodes grouped to pairs: edges
                              // this allows defining vertices without any edges
                              // vertices must not be edn vectors
                              like: [1 2] [2 3] [3 1]         -> 2
                              like: 1 2 3 4 [1 2] [2 3] [3 1] -> 0

  --simple         -s         input is flat, 2 consecutive vertices are considered to be an edge (default)
                              like: 1 2 2 3 3 1

  --full N         -f         use a full graph of N vertices (for testing etc.)
  --random N       -r         use an undirected graph of N vertices with
                              a random subset of edges (for testing etc.)

  --help           -h         show this help
  --version                   show version of Gecf

What can be used as vertex identifier? - any edn structure/value. (You might prefer values that are fast to hash and compare.)
Stdin is assumed to be in edn format.

                                \w "weighted"
                                \i "implicit"
                                \c "cut"
                                \C "cut-edn"
                                \A "all"
                                \f "full"
                                \r "random"
                                \h "help"
