Topological sorting for Directed Acyclic Graph (DAG) is a linear ordering of vertices such that for every directed edge u v, vertex u comes before v in the ordering.
Programming language
[ ] C
[x] C++
[ ] Java
[ ] Python
@Ayush7614 Bhiya, I would like to work on this issue in C++. Please assign it to me.
Aim
linear ordering of vertices
Details
Topological sorting for Directed Acyclic Graph (DAG) is a linear ordering of vertices such that for every directed edge u v, vertex u comes before v in the ordering.
Programming language
@Ayush7614 Bhiya, I would like to work on this issue in C++. Please assign it to me.