|abortion||affirmative action||alcohol||amusement parks||architecture||automobile industries|
|computational complexity||computational geometry||death penalty||genetic||geometry||globalization|
|gun control||iraq war||jaguar||jordan||moon landing||movies|
|national parks||net censorship||randomized algorithms||recipes||roswell||search engines|
||shakespeare||table tennis||vintage cars||weather||
The Nodes file: The file nodes.txt is formatted as follows. First there is an entry that gives the number of pages in the graph. Then there is a list of the page entries. An example of a page entry is the following
34 (67) [R]
Accuracy & Computational Complexity
The first number is the page id, a unique indetifier for each page. The second number is an id assigned to the page, when it is first entered in the base set (this can be ignored). The character associated with each page describes the type of the page. The character R is for the pages in the Root set, the character O is for the pages that are pointed to by a page in the root set, and character I is for the pages that point to a page in the root set. The following line is the http address of the page, and the next the title of the page. The two numbers in the last line are the in and out degree of the node.
The Adjancency List file: Stores the adjacency list of the undelying graph of the pages. Each entry of the list is in the form
which means that the page with id pid,
points to the pages with ids pid1,pid2,.....,pidN.
for the C code for making the adjacency list into a matrix.
The Inverted Adjancency List file: Stores the inverted adjacency list of the undelying graph of the pages. Each entry of the list is in the form