Closed ravisehrawat closed 2 years ago
Problem Statement: Given a DAG( Directed Acyclic Graph ), print all the vertex of the graph in a topologically sorted order. If there are multiple solutions, print any.
Pre-req: DFS traversal, Graphs, Stack data structure.
Problem Statement: Given a DAG( Directed Acyclic Graph ), print all the vertex of the graph in a topologically sorted order. If there are multiple solutions, print any.
Pre-req: DFS traversal, Graphs, Stack data structure.