From bb839cb48f8b802abb471effa33deb78fc6624df Mon Sep 17 00:00:00 2001 From: Gary King Date: Sat, 6 Sep 2008 21:01:58 -0400 Subject: [PATCH] parenthetically speaking, the definition of find-edge-between-vertexes was borked. darcs-hash:20080907010158-3cc5d-cd936c21f97e7205ea8b3b98e974abe45093dc94.gz --- dev/graph.lisp | 7 ++++--- 1 file changed, 4 insertions(+), 3 deletions(-) diff --git a/dev/graph.lisp b/dev/graph.lisp index d71ab6c..6ff6b65 100644 --- a/dev/graph.lisp +++ b/dev/graph.lisp @@ -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))))) ;;; --------------------------------------------------------------------------- -- 1.7.10.4