Topological Sort in Go#581
Merged
Pradeepsingh61 merged 1 commit intoPradeepsingh61:mainfrom Oct 10, 2025
Merged
Conversation
github-actions
Bot
added
first-time-contributor
go
good first issue
|
🎉 Welcome to Hacktoberfest 2025, @Shubham-Khetan-2005! 🎃 Thank you for your first contribution to our DSA repository! Here's what happens next: 🔍 Automatic Checks
📋 Next Steps🎯 Great job! Your code compiled successfully. Maintainers @Karanjot786 and @Pradeepsingh61 will review your PR soon. 🎁 What You Get
💡 Tips for Success
Welcome to the community! 🚀 |
🤖 Automated PR Status🔍 Code Validation✅ Passed - File naming and structure look good! 🧪 Compilation Tests✅ Passed - All code compiles successfully! 📋 Overall Status🎉 Ready for Review - Your PR has passed all automated checks! This comment was generated automatically. Checks will re-run when you push new commits. |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Add Topological Sort (Kahn's Algorithm) in Go
Added an implementation of Topological Sort for Directed Acyclic Graphs (DAGs). This version uses Kahn's algorithm, a BFS-based approach that correctly identifies and handles cycles. A key feature is its deterministic output; when multiple nodes are available to be added to the sort, it prioritizes them based on their insertion order using a min-heap.
Features 🚀
Provides a linear ordering of vertices such that for every directed edge from vertex u to vertex v, u comes before v in the ordering.
Implements Kahn's algorithm using a queue (specifically, a min-heap) of zero-in-degree nodes.
Guarantees deterministic results by breaking ties based on the order in which nodes were first added to the graph.
Includes built-in cycle detection: returns nil if the graph is not a DAG.
Comes with a test suite covering simple DAGs, graphs with cycles, and disconnected components.
Complexity Analysis 📊
Time Complexity
O(V+E), as each vertex and edge is processed a constant number of times.
Space Complexity
O(V+E) to store the graph's adjacency list, in-degree counts, and the queue.