无向图上的networkx pagerank？

Question

我注意到您可以将 pagerank 应用于 networkx Graph() 和 DiGraph() 中的无向图。这是什么意思？它是否简单地将无向图中的每条边视为双向？

谢谢

Answer 1

来自the documentation：

Undirected graphs will be converted to a directed graph with two directed edges for each undirected edge.