We've found that it can be prohibitively expensive to delete paths on graphs with high path depth, since each delete operation is ~O(path depth * path length). This PR implements a batch delete that can pay this cost once across a (potentially large) number of path deletes.
We've found that it can be prohibitively expensive to delete paths on graphs with high path depth, since each delete operation is ~
O(path depth * path length). This PR implements a batch delete that can pay this cost once across a (potentially large) number of path deletes.