<?xml version="1.0" encoding="UTF-8"?>
<commit>
  <added type="array"/>
  <modified type="array">
    <modified>
      <diff>@@ -23,7 +23,7 @@ Yes, but I think they aren't as fast or feature filled. Flogic has a good simple
 * Instance method injections (root?,leaf?) for graph nodes
 * O(1) lookups, no breath or depth first searching
 * O(x*y) insert, update and delete, where x &amp; y are the number of ancestors and descendants of a node.
-
+ 
 == Requirements
 
 This uses named_scope so your going to need Rails 2.1 or above.</diff>
      <filename>README.rdoc</filename>
    </modified>
  </modified>
  <removed type="array"/>
  <parents type="array">
    <parent>
      <id>a6cecb91b04c20b6ba9b2192f259a4e766bc8310</id>
    </parent>
  </parents>
  <author>
    <name>Matthew Leventi</name>
    <email>mleventi@mleventi-laptop.(none)</email>
  </author>
  <url>http://github.com/mleventi/acts-as-dag/commit/01b205d4938ab1a428963ffea66a494c45c48a79</url>
  <id>01b205d4938ab1a428963ffea66a494c45c48a79</id>
  <committed-date>2008-08-07T02:25:00-07:00</committed-date>
  <authored-date>2008-08-07T02:25:00-07:00</authored-date>
  <message>Testing New commit</message>
  <tree>613431cace40c7d4367fcb24592434b26cbfc11f</tree>
  <committer>
    <name>Matthew Leventi</name>
    <email>mleventi@mleventi-laptop.(none)</email>
  </committer>
</commit>
