To compute a movement buildability, we only examine nodes that are
ancestors or descendants of said movement. Instead of computing a closure of a set of nodes, and in a second step filter nodes to only match those "related" to self, it's better to compute directly a smaller closure, only consisting of [self] That's about 3-4 times faster. git-svn-id: https://svn.erp5.org/repos/public/erp5/trunk@36587 20353a03-c40f-0410-a6d1-a30d3c3de9de
Showing
Please register or sign in to comment