graph_walk.clj

(defn point [n n-lst visited-n]
  (let [res (for [next (map (fn [pair] (= n (first pair))) n-lst)
                  :when (not (some next visited-n))]
              next)]
    (println (some list? res))
    res))

(defn walk [n1 n2 n-lst]
  (loop [curr n1
         visited '()]
    (let [next (point curr n-lst visited)]
      (cond (= curr n2) true
            (not next) false
            :else (recur next
                         (cons curr visited))))))

(def test1 '( '(a b) '(b d) '(b c)))