I just read the chapter of graph traversing from HtDP's website: http://www.ccs.neu.edu/home/matthias/HtDP2e/part_five.html#%28part._fsm._sec~3atraverse-graph1%29
The implementation of graph traversing is the calling sequence of: `find-path` -> `find-path/list` -> `find-path` -> ... I must say this is the best DFS algorithm implementation I've ever found. I was wondering if maybe we could implement the topological sorting algorithm in this HtDP-y way? Or maybe is that not necessary? I found an elegant implementation in which the core function `visit` call itself: https://github.com/carl-eastlund/mischief/blob/master/mischief/sort.rkt -- You received this message because you are subscribed to the Google Groups "Racket Users" group. To unsubscribe from this group and stop receiving emails from it, send an email to racket-users+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/d/optout.
