suzanne.soy/racket
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

finished for now, checkpointing

Browse Source 
svn: r13644
This commit is contained in:
Robby Findler 2009-02-16 02:24:41 +00:00
parent 3205875736
commit ae55a5b636
1 changed files with 5 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
collects/games/chat-noir/chat-noir-literate.ss
View File

@ -83,7 +83,11 @@ which is a list of @scheme[dist-cell] structs:
@chunk[<graph>
(define-struct dist-cell (p n) #:transparent)]
Each @tt{p} field in the @scheme[dist-cell] is
Each @tt{p} field in the @scheme[dist-cell] is a position on the board
and the @tt{n} field is a natural number or @scheme['∞], indicating
the distance of the shortest path from the node to some fixed point
on the board. The fixed point is not represented in the @scheme[distance-map], but
is required when constructing one.
The core of the breadth-first search is this function,
@scheme[bst]. It accepts a @scheme[queue] and a