module matrix has no attribute matrix

使用弗洛伊德算法模拟最短路径时出现module matrix has no attribute matrix

import xlrd
import sys

def matrix(address):                           #读取excel生成邻接矩阵
    wb = xlrd.open_workbook(address)
    sheet1 = wb.sheet_by_name('邻接矩阵_距离')
    L = []
    for i in range(1,51):
        a = sheet1.row_values(i)
        a.remove(a[0])
        L.append([int(x) for x in a])
    # print(L)
    return L

from pylab import *
import matrix


def floyd(d):
    D=d
    lengthD = len(D)                    #邻接矩阵大小
    p = list(range(lengthD))
    P = []
    for i in range(lengthD):
        P.append(p)
    P = array(P)
    for k in range(lengthD):
        for i in range(lengthD):
            for j in range(lengthD):
                if(D[i][j] >D[i][k]+D[j][k]):         #两个顶点直接较小的间接路径替换较大的直接路径
                    P[i][j] = P[i][k]                 #记录新路径的前驱
                    D[i][j] = D[i][k]+D[j][k]
    print('各个顶点的最短路径:')
    for i in range(lengthD):
        for j in range(i+1,lengthD):
            print('v%d' % (i+1) + '--' + 'v%d' % (j+1) + '\t' + 'dist_min:' + '\t' + str(D[i][j]) + '\t' + 'path:'+'v%d'%(i+1),end='' )
            temp=P[i][j]
            while (temp!=j):
                print('--'+'v%d'%(temp+1),end='')
                temp=P[temp][j]
            print('--'+'v%d'%(j+1))
    print('P矩阵:')
    print(P)
    print('D矩阵:')
    for i in D:
        print(i)
    return D


if __name__ == '__main__':
    chararray = ['1','2','3','4','5','6','7','8','9','10','11','12','13','14','15','16','17','18','19','20','21','22','23','24','25','26','27','28','29','30','31','32','33','34','35','36','37','38','39','40','41','42','43','44','45','46','47','48','49','50']
    L=[]
    for i in range(1,len(chararray)+1):
        L.append('v%d'%i)
    Dict=dict(zip(L,chararray))
    print('各点对应关系：')
    print(Dict)
    address = 'C:\\Users\11573\Desktop\python\数据及代码\数据/邻接矩阵.xlsx'
    data=matrix.matrix(address)
    d=matrix.tran_m(data)
    floyd(d)

————————————————
版权声明：本文为****博主「heavenmark」的原创文章，遵循CC 4.0 BY-SA版权协议，转载请附上原文出处链接及本声明。
原文链接：https://blog.****.net/heavenmark/article/details/82794565

源代码来自与同站博主heavenmark