(defn remove-loops "For each node n, remove any edges n->n." [g] (struct directed-graph (:nodes g) (into {} (map (fn [n] [n (disj (set (get-neighbors g n)) n)]) (:nodes g)))))
Comments top
No comments for remove-loops. Log in to add a comment.