parenthetically speaking, the definition of find-edge-between-vertexes was borked.
authorGary King <gwking@metabang.com>
Sun, 7 Sep 2008 01:01:58 +0000 (21:01 -0400)
committerGary King <gwking@metabang.com>
Sun, 7 Sep 2008 01:01:58 +0000 (21:01 -0400)
darcs-hash:20080907010158-3cc5d-cd936c21f97e7205ea8b3b98e974abe45093dc94.gz

dev/graph.lisp

index d71ab6c..6ff6b65 100644 (file)
@@ -461,9 +461,10 @@ something is putting something on the vertexes plist's
      &key (error-if-not-found? t))
   (let* ((v1 (find-vertex graph value-1 error-if-not-found?))
         (v2 (find-vertex graph value-2 error-if-not-found?)))
-    (or (and v1 v2 (find-edge-between-vertexes graph v1 v2)))
-    (when error-if-not-found?
-      (error 'graph-edge-not-found-error :vertex-1 v1 :vertex-2 v2))))
+    (or (and v1 v2 (find-edge-between-vertexes graph v1 v2))
+       (when error-if-not-found?
+         (error 'graph-edge-not-found-error
+                :graph graph :vertex-1 v1 :vertex-2 v2)))))
 
 ;;; ---------------------------------------------------------------------------