PageRankVector

As of Version 10, all the functionality of the GraphUtilities package is built into the Wolfram System. >>

PageRankVector[g]
returns the page rank of the graph g.

更多信息更多信息

  • PageRankVector functionality is now available in the built-in Wolfram Language function PageRankCentrality.
  • To use , you first need to load the Graph Utilities Package using Needs["GraphUtilities`"].
  • The following options can be given:
  • ToleranceAutomaticthe tolerance that should be allowed in computing results
    TeleportProbability0.15the probability that an internet user may choose to visit a vertex at random instead of choosing an outlink
    RemoveSinksTruewhether sinks (a sink is a vertex with no outer links) are removed by linking with all vertices
  • calculates the page rank of nodes in a directed graph and returns them as a vector. The ordering of the vector is the same as that of VertexList.

范例范例打开所有单元关闭所有单元

基本范例  (2)基本范例  (2)

This shows a small network of web pages:

In[1]:=
Click for copyable input
In[2]:=
Click for copyable input
In[3]:=
Click for copyable input
Out[3]=

This calculates the page ranks:

In[4]:=
Click for copyable input
Out[4]=

has been superseded by PageRankCentrality:

In[1]:=
Click for copyable input
Out[1]=
In[2]:=
Click for copyable input
Out[2]=