The non-network structure given by the diagram or directed graph, it can be constructed corresponding adjacency matrix Q.
Further, the i-th PageRank is a linear combination of other pages PageRank value, each combination coefficient is the inverse number of the corresponding link pages.
This makes it possible to establish the equation r = Qr, wherein the vector is vector r PageRank value of each page constituted, and therefore the problem to find the page sorting has become an issue on the conversion request vector r, i.e. the Eigenvalue equations problem. Below are solved by an iterative method Jacbi and a power of law:
Jacbi iterative method
The experimental results and the source code shown below:
bar outputted from the experimental results, it is possible that up to a high PageRank value corresponding to higher.
Power Algorithm
