Algorithm · Glean · Hard
Simulate the core logic of a rate-limited Wikipedia crawler over a directed page graph. The graph is given by pages, where each key is a page title that can be fetched successfully, and the associated value is the list of outgoing page titles found on that page. If a crawled title is not a key in pages, treat the fetch as failed: the title still counts as crawled and appears in the crawl order, but it contributes no outgoing links. Start from start and crawl at most…
Checking your access…