Which algorithm efficiently calculates the single source shortest paths in a Directed Acyclic Graph?

• A. topological sort
• B. hash table
• C. binary search
• D. radix sort