PageRankVector
GraphUtilities`
GraphUtilities`
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 PageRankVector, you first need to load the Graph Utilities Package using Needs["GraphUtilities`"].
- The following options can be given:
-
Tolerance Automatic the tolerance that should be allowed in computing results TeleportProbability 0.15 the probability that an internet user may choose to visit a vertex at random instead of choosing an outlink RemoveSinks True whether sinks (a sink is a vertex with no outer links) are removed by linking with all vertices - PageRankVector 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)
This shows a small network of web pages:
This calculates the page ranks:
PageRankVector has been superseded by PageRankCentrality:
Wolfram Research (2007)，PageRankVector，Wolfram 语言函数，https://reference.wolfram.com/language/GraphUtilities/ref/PageRankVector.html.
文本
Wolfram Research (2007)，PageRankVector，Wolfram 语言函数，https://reference.wolfram.com/language/GraphUtilities/ref/PageRankVector.html.
CMS
Wolfram 语言. 2007. "PageRankVector." Wolfram 语言与系统参考资料中心. Wolfram Research. https://reference.wolfram.com/language/GraphUtilities/ref/PageRankVector.html.
APA
Wolfram 语言. (2007). PageRankVector. Wolfram 语言与系统参考资料中心. 追溯自 https://reference.wolfram.com/language/GraphUtilities/ref/PageRankVector.html 年