title: Size of a graph using adjacency list versus adjacency matrix?
body: <p>Suppose there are 2<sup>36</sup> web pages and on average each web page has 2<sup>4</sup> hyperlinks.  Consider the directed graph with one vertex per web page and an edge between two vertices if there is a hyperlink between the web pages the vertices represent. How many terabytes would it take to represent the graph using an adjacency matrix? Using an adjacency list? My question is what would be the main difference between the list and the matrix?</p>