CAJ | 학술논문

采用手工求解图中任意两顶点间的距离,计算量大且繁琐.本文给出了根据图的邻接矩阵的各次幂求解图的距离矩阵的算法,从而实现了完全应用程序求解,在很大程度上解决了上述问题所遇到的难点,尤其是图中顶点较多时使该问题变得非常容易求解.
채용수공구해도중임의량정점간적거리,계산량대차번쇄.본문급출료근거도적린접구진적각차멱구해도적거리구진적산법,종이실현료완전응용정서구해,재흔대정도상해결료상술문제소우도적난점,우기시도중정점교다시사해문제변득비상용역구해.
The distance between any two vertices to manually calculate in the figure,and require a large quantity of calcula-tion, which is very complex. In this paper, the algorithm based on the Adjacency matrix of power and is realized by program completely. This solved the difficulties above greatly and made more complicated problems:multi-vertex distance matrix prob-lem very easy.