PageRank

Description

This is an academic project implementing the PageRank algorithm and one more with the ZAP factor. The "examples" folder contains some graph descriptions respecting the Standford format (see http://snap.stanford.edu/data/index.html). The implementing algorithms are tested on these graph and the main purpose of this little project is to simulate an search (like the google, bing, yahoo search) but the results is only nodes numbers.

Compilation

In a terminal, enter the command make.

The project is compiled with the new standard of C++ in order to test the functionalities provided by the standard.

Execution

The compilation will create the search_word executable and you can try with this way :

$ ./search_words examples/Amazon.txt

By default, the number of printed results is 10 by you can change this number

with this way :

$ ./search_words examples/Amazon.txt 100

It will show the first 100 results until 10.