An Algorithms and Data Structure repository containing implementation of various basic and advanced DS,with some competitive programming questions based on them.
2
stars
0
forks
source link
Introduce a condition to check whether a graph is DAG in topsort algo.Return empty vector if its not a DAG #2
Since the Topological sorting works on a Directed Acyclic Graph ,Introduce a function in the Topological sorting algorithm to ensure the graph is a DAG before going into the function.Return an empty vector if it is not a DAG
Since the Topological sorting works on a Directed Acyclic Graph ,Introduce a function in the Topological sorting algorithm to ensure the graph is a DAG before going into the function.Return an empty vector if it is not a DAG