Implement the a* algorithm
This commit is contained in:
11
demo.scm
11
demo.scm
@@ -19,11 +19,18 @@
|
||||
(cdr pair))))
|
||||
graph))
|
||||
|
||||
(define graph-generator
|
||||
(define djikstra-generator
|
||||
(make-generator
|
||||
(lambda (yield)
|
||||
(djikstra graph 90 9 (lambda (visited heap)
|
||||
(yield (color-graph graph visited heap))))
|
||||
#f)))
|
||||
(define a*-generator
|
||||
(make-generator
|
||||
(lambda (yield)
|
||||
(a* graph 90 9 (lambda (visited heap)
|
||||
(yield (color-graph graph visited heap))))
|
||||
#f)))
|
||||
(write-graphs-to-file "djikstra.webp" djikstra-generator)
|
||||
(write-graphs-to-file "astar.webp" a*-generator)
|
||||
|
||||
(write-graphs-to-file "djikstra.webp" graph-generator)
|
||||
|
||||
Reference in New Issue
Block a user