Algorithm · Snowflake · Medium
Wiki Hopper: Crawl All Reachable Pages Easy · Topics · Company Tags · Hints Imagine a web crawl where pages are nodes in a directed graph. A directed edge u -> v means page u contains a hyperlink to page v. Starting from start, collect every unique page ID that can be reached by following any number of links, including no traversal at all. Page IDs range from 0 to n - 1. The graph is not necessarily simple: it may contain cycles, self-links, and repeated edges from the same…
Checking your access…