Not too expensive, you can use parallel IDDFS to get a good approximation quickly. (Especially if you pick a good heuristic to follow links.) Challenging part

Not too expensive, you can use parallel IDDFS to get a good approximation quickly. (Especially if you pick a good heuristic to follow links.) Challenging part is keeping track of already visited pages to break cycles - some variant of a Bloom filter will help.