projects
/
cl-graph.git
/ commitdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
| commitdiff |
tree
raw
|
patch
|
inline
| side by side (from parent 1:
bf38951
)
s/graph-search/graph-search-for-cl-graph/ to keep packages happy
author
Gary King
<gwking@metabang.com>
Tue, 10 Jun 2008 15:34:55 +0000
(11:34 -0400)
committer
Gary King
<gwking@metabang.com>
Tue, 10 Jun 2008 15:34:55 +0000
(11:34 -0400)
darcs-hash:
20080610153455
-3cc5d-
190becd05afdf810a3c2e4b9f50a5de267eccb8a
.gz
dev/graph.lisp
patch
|
blob
|
history
diff --git
a/dev/graph.lisp
b/dev/graph.lisp
index
663088b
..
d71ab6c
100644
(file)
--- a/
dev/graph.lisp
+++ b/
dev/graph.lisp
@@
-848,15
+848,15
@@
something is putting something on the vertexes plist's
;;; ---------------------------------------------------------------------------
;; also in metatilites
;;; ---------------------------------------------------------------------------
;; also in metatilites
-(defun graph-search (states goal-p successors combiner
- &key (state= #'eql) old-states
- (new-state-fn #'new-states))
+(defun graph-search-for-cl-graph (states goal-p successors combiner
+ &key (state= #'eql) old-states
+ (new-state-fn #'new-states))
"Find a state that satisfies goal-p. Start with states,
and search according to successors and combiner.
Don't try the same state twice."
(cond ((null states) nil)
((funcall goal-p (first states)) (first states))
"Find a state that satisfies goal-p. Start with states,
and search according to successors and combiner.
Don't try the same state twice."
(cond ((null states) nil)
((funcall goal-p (first states)) (first states))
- (t (graph-search
+ (t (graph-search-for-cl-graph
(funcall
combiner
(funcall new-state-fn states successors state= old-states)
(funcall
combiner
(funcall new-state-fn states successors state= old-states)
@@
-870,7
+870,7
@@
something is putting something on the vertexes plist's
(defmethod in-cycle-p ((graph basic-graph) (start-vertex basic-vertex))
(let ((first-time? t))
(not (null
(defmethod in-cycle-p ((graph basic-graph) (start-vertex basic-vertex))
(let ((first-time? t))
(not (null
- (graph-search
+ (graph-search-for-cl-graph
(list start-vertex)
(lambda (v)
(if first-time?
(list start-vertex)
(lambda (v)
(if first-time?