On the Computational Complexity of Multi-Agent Pathfinding on Directed Graphs