文件名称:最短路径的求解
介绍说明--下载内容均来自于网络,请自行研究使用
本实验中的问题是一个逻辑问题,而实验的目的是运用邻接矩阵解决图存储并解决在此结构情况下对矩阵中元素的扫描计算。其关键是怎样储存和计算。储存用的是邻接矩阵,而计算是用迪杰斯特拉算法。-experiment of the problem is a problem of logic, and The purpose of this experiment is to use the adjacency matrix storage solutions and plans to solve the structure of the matrix elements of scanning calculation. The key is how storage and computation. The store is adjacent matrix, which is calculated using Floyd algorithm.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
最短路径的求解.doc