Shortest Path using Topological Sort

In this article, we have explained the algorithm to find the shortest path in a Directed Acyclic Graph using Topological Sort.

Table of content:

Problem StatementApproachPseudo Code for Topological Sorting (DFS)Pseudo Code for finding Shortest path using Topological SortingTime ComplexityComparison of Topological Sorting with other shortest distance finding algorithmsApplication of Topological SortingQuestion

We will dive into it now.

Problem Statement

We are given with a weighted direc...