#73 added All Pairs Shortest Paths on undirected graphs. We could add an argument to support the same algorithm on fully directed graphs. That would require loading the edges into a NetworkX DiGraph.