PageRank算法

# Author:Wyy
# -*- coding = utf-8 -*-
# @Time :2022/9/12 
# @Author:WYY
# @Site :
# @File :谷歌搜算算法.py
# @Software: PyCharm
# 输入为一个*.txt文件，例如
# A B
# B C
# B A
# ...表示前者指向后者

import numpy as np
import networkx as nx
import matplotlib.pyplot as plt


if __name__ == '__main__':

    # 读入有向图，存储边
    f = open('input_1.txt', 'r')
    edges = [line.strip('\n').split(' ') for line in f]
    print(edges)
    G = nx.DiGraph()
    for edge in edges:
        G.add_edge(edge[0], edge[1])
    nx.draw(G, with_labels=True)
    plt.show()

    # 根据边获取节点的集合
    nodes = []
    for edge in edges:
        if edge[0] not in nodes:
            nodes.append(edge[0])
        if edge[1] not in nodes:
            nodes.append(edge[1])
    print(nodes)

    N = len(nodes)

    # 将节点符号（字母），映射成阿拉伯数字，便于后面生成A矩阵/S矩阵
    i = 0
    node_to_num