Finding paths and deleting edges in directed acyclic graphs