recursive, depth-first implementation #9
Merged
Conversation
This file contains 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
added 7 commits
February 25, 2020 09:17
- add debug_print method - add colorized stdout messages - add human readable byte printout - auto PEP8 styling Previously, selecting links from pages requried scraping all root URLs first. New algorithm randomly selects root_url, then recursively browses down to a random depth and then starts over again. The intent was to simulate slightly more realistic browsing traffic.
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.
Previously, selecting links from pages required scraping all root
URLs first. New algorithm randomly selects root_url, then recursively
browses down to a random depth and then starts over again. The intent
was to simulate slightly more realistic browsing traffic.