@rafi

This week I've been working on two tree traversal algorithms: one for garbage collection and another for circular reference mapping. I implemented BFS for gc and DFS tor refs. I used different approach for different problem for better performance. In my case perf wasn't really that important but I enjoyed the process of making it more performant because it gives me pleasure. (Yay to non-commercial work!) As in a terminal, so in life: I try to oscillate between the two

1 reply

0 recast

1 reaction