i took a cs class at unr back almost two years ago and they taught us how to build state machines. it's a really cool topic but i hadn't had any reason to use one. today i implemented a binary tree iterator using a state machine. instead of using a stack each node has a parent pointer. the iterator has pointers to the current and previous nodes. i'm pretty stoked.
Posted by drewish at November 6, 2003 08:20 PMTrackBack URL for this entry:
http://drewish.com/mt/mt-tb.cgi/809
Thanks for signing in, . Now you can comment. (sign out)
(If you haven't left a comment here before, you may need to be approved by the site owner before your comment will appear. Until then, it won't appear on the entry. Thanks for waiting.)