search

CodeHarborHub / codeharborhub.github.io

Welcome to CodeHarborHub! Our mission is to provide accessible and comprehensive educational resources to learners of all levels, from beginners to advanced professionals. Whether you're looking to kickstart your career in web development, master a new programming language, or stay updated on the latest tech trends, we've got you covered.
https://codeharborhub.github.io/
MIT License
80 stars 162 forks source link

[Feature Request]: Adding topological sorting into Graph Algorithms #2850

Closed Santhosh-Siddhardha closed 3 months ago

Santhosh-Siddhardha commented 3 months ago

Is there an existing issue for this?

Feature Description

Topological Sorting of a directed acyclic graph (DAG) is a linear ordering of its vertices such that for every directed edge UV from vertex U to vertex V, U comes before V in the ordering.

Use Case

Task Scheduling: Topological sorting is used to schedule tasks in a way that respects their dependencies, such as compiling tasks in a build system. Course Prerequisites: In education platforms, it helps to determine the order in which courses should be taken based on prerequisites.

Benefits

No response

Add ScreenShots

No response

Priority

High

Record

github-actions[bot] commented 3 months ago

Hi @Santhosh-Siddhardha! Thanks for opening this issue. We appreciate your contribution to this open-source project. Your input is valuable and we aim to respond or assign your issue as soon as possible. Thanks again!

github-actions[bot] commented 3 months ago

Hello @Santhosh-Siddhardha! Your issue #2850 has been closed. Thank you for your contribution!