| http://www.w3.org/ns/prov#value | - TIVE);+ + /* if one is an ancestor of the other */+ /* XXX there might be a better sorting algorithm for stable topological sort, this is O(n^2) worst case */+ for (parent = a->parent; parent; parent=parent->parent) {+ /* if b is an ancestor, it is always behind a */+ if (parent==b)+ return 1;+ /* any selected ancestor moves the node forward */+ if (parent->flag & NODE_ACTIVE)+
|
