   "For each node n, add the edge n->n if not already present."
   [g]
   (make-directed-graph
-          (nodes g)
-          (into {} (map (fn [n]
-                          [n (conj (set (get-neighbors g n)) n)]) (nodes g)))))
+    (nodes g)
+    (into {} (map (fn [n]
+                    [n (conj (set (get-neighbors g n)) n)]) (nodes g)))))
 
 (defn remove-loops
   "For each node n, remove any edges n->n."
   [g]
   (make-directed-graph
-          (nodes g)
-          (into {} (map (fn [n]
-                          [n (disj (set (get-neighbors g n)) n)]) (nodes g)))))
+    (nodes g)
+    (into {} (map (fn [n]
+                    [n (disj (set (get-neighbors g n)) n)]) (nodes g)))))
 
 
 ;; Graph Walk

;; and more modifications for use with loom/ubergraph

(ns
    #^{:author "Jeffrey Straszheim",
       :doc "Basic graph theory algorithms"}
  conexp.util.graph
  (:require [ubergraph.core :as uber]
            [loom.graph :as lg])

provide a set of visited notes (v) and a collection of nodes to
visit (ns)."
  ([g n]
   (lazy-walk g [n] #{}))
  ([g ns v]
   (lazy-seq (let [s (seq (drop-while v ns))
                   n (first s)
                   ns (rest s)]
               (when s
                 (cons n (lazy-walk g (concat (get-neighbors g n) ns) (conj v n))))))))

(defn transitive-closure
  "Returns the transitive closure of a graph. The neighbors are lazily computed.
