I have studied the Floyd-Warshall and Johnson algorithms. I am trying to understand if the all pairs shortest paths research in a directed graph G can be implemented in a more efficient way if I already know that G is acyclic. Do you have any ideas?
All pairs shortest paths in a DAG
graph algorithms;directed acyclic graph;topological graph theory