Added Topological Sorting #171
Merged
Conversation
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
ashwek
reviewed
Feb 18, 2019
| reverse(ans.begin(), ans.end()); | ||
| } | ||
| int main(){ | ||
| cin >> n >> m; |
There was a problem hiding this comment.
please add cout<<"enter number of vertices and edges = "; or something similar so the user knows what input has to be given.
ashwek
reviewed
Feb 18, 2019
Graph/Topological-Sort.cpp
Outdated
| topological_sort(); | ||
| cout << "Topological Order : \n"; | ||
| for(int v : ans) { | ||
| cout << v << ' '; |
There was a problem hiding this comment.
if you are converting 1-indexed to 0-indexed after input, you should convert 0-indexed to 1-indexed before output too. (User will input 1 vertex but will see 0 in output)
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
Added an implementation of Topological Sort for Directed Graphs.