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.
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
volume command #1747
volume command #1747
Changes from all commits
ef0d506
4dd4f99
f9ab549
File filter
Filter by extension
Conversations
Jump to
There are no files selected for viewing
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
This comment seems a little misleading --- the reason for prepending the$O(n)$ overall since each vertex occurs as a new neighbor at most once. Whereas appending $O(n)$ work appending.
visitableNeighbors
is because we're treatingpending
as a stack rather than a queue, not because it is more efficient (though I agree it will be). Regardless of which list is shorter, prepending thevisitableNeighbors
will take constant time per new neighbor, and hencevisitableNeighbors
will take time linear in the number of vertices in the queue, but the same vertices might be in the queue for multiple iterations, so we can end up doing more thanThere was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Well, I originally went about this intending to implement BFS, until I got to this line and realized that appending to the
pending
list would be expensive (and I couldn't be bothered to useSeq
instead of[]
). So I decided to prepend instead, which turned it into DFS.