Topological Sorting

[Yash091]

🚀 Feature

Topological Sorting is a linear ordering of vertices such that for every directed edge u v, vertex u comes before v in the ordering. Topological Sorting for a graph is not possible if the graph is not a DAG.

Have you read the Contribution Guidelines?

YES

Pitch

Topological Sorting is advanced algorithm mainly used for scheduling jobs from the given dependencies among jobs

Assignees

(Do not make changes in this section until asked to do so)
C - @arihantthriwe C# - @codesanta142 C++ - @Yash091 Go -
Java -
Javascript -
Kotlin -
Python -

[Yash091]

@manan025 i would like to contribute in C++. Please assign it to me.

[manan025]

@Yash091 C++ assigned

[arihantthriwe]

@manan025 i would like to contribute in C. Please assign it to me. :)

[codesanta142]

@manan025 i would like to contribute in C#. Please assign it to me.

[manan025]

@codesanta142 Sure - C# Assigned

[manan025]

@arihantthriwe - C assigned