Is there an existing issue for this?

• I have searched the existing issues

Feature Description

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.

Use Case

Topological Sort technique is missing . If added, will enhance the projects use case.

Benefits

Topological Sort technique is missing . If added, will enhance the projects use case.

Add ScreenShots

Priority

High

Record

• I have read the Contributing Guidelines
• I'm a GSSOC'24 contributor
• I have starred the repository