Kahn’s Algorithm

[muskandn]

Given a Directed Acyclic Graph (DAG) with V vertices and E edges, Find any Topological Sorting of that Graph. In topological sorting, node u will always appear before node v if there is a directed edge from node u towards node v(u -> v).

I want to code this very important algorithm in C++.
@heysaiyad Please assign this issue to me.

[ashfaque-mustaque]

assign me

[Jugnu-Gupta]

@shivaylamba can you please assign this task to me

[Nishantsurve]

I wanted to express my interest and willingness to take ownership of the issue currently pending ,I had worked upon this earlier so I believe that my skills and expertise align well with the needs of the issue, kindly please assign me this issue