dfs without repetition through a graph

dfs.clj

(def grapph {
;some stuff
})

(defn neighbors [node]
  (get graph node))

(defn dft [node visited-so-far]
  (let [new-visited-so-far (set (conj visited-so-far node))
        unvisited-children (set (remove visited-so-far (set (neighbors node))))
        results-from-children (reduce
                                (fn [state child]
                                  (let [visit-from-child (dft child (:visited-so-far state))]
                                    {:visited-so-far (clojure.set/union (:visited-so-far state) (:visited-so-far visit-from-child))
                                     :node-sequence (concat (:node-sequence state) (:node-sequence visit-from-child))}))
                                {:visited-so-far new-visited-so-far
                                 :node-sequence []}
                                unvisited-children)]
    {:node-sequence (cons node (:node-sequence results-from-children))
     :visited-so-far (clojure.set/union new-visited-so-far (:visited-so-far results-from-children))}))