(let ((element (element (parent component))))
(unless (item-at found-elements element)
(setf (item-at found-elements element) t)
-
- (push (subgraph-containing graph (element component)
+ (push (subgraph-containing graph (element component)
most-positive-fixnum)
result)))))
(add-edge-between-vertexes g :w :z :edge-type :directed)
(add-edge-between-vertexes g :z :z :edge-type :directed
:if-duplicate-do :force)
- (assert (equal '(:X :Y :V :U :Z :W)
+ (print (mapcar #'element (dfs g :u #'identity)))
+ (assert (equal '(:x :y :v :u :z :w)
(mapcar #'element (dfs g :u #'identity)))))
;;; ***************************************************************************
;;; * End of File *
-;;; ***************************************************************************
\ No newline at end of file
+;;; ***************************************************************************