source/blog/posts/2008/08/algorithms-summary.dot

   1
   2 digraph gc
   3 {
   4         node [fontsize=12];
   5         gc [label="Garbage Collector"];
   6         rc [label="Reference Counting"];
   7         tr [label="Tracing"];
   8         ms [label="Mark & Sweep"];
   9         nm [label="Non-Moving"];
  10         mv [label="Moving"];
  11         mc [label="Mark-Compact"];
  12         cp [label="Copying"];
  13         gc -> { rc tr };
  14         tr -> { nm mv };
  15         mv -> { mc cp };
  16         nm -> ms;
  17 }
  18