As the author of the above article, I'd like to point out that the adjacency matrix is extremely sparse. If you use a sparse representation of the link matrix (as I have done -- your claim is incorrect), its space usage will scale as O(N), and not as O(N^2) as you suggest.

By that of course I don't mean to say you can use this script to build your own google.... but the problems lie elsewhere.