交互网络上任意节点对的最短路径集解法

搜索交互网络中的最短路径是研究网络结构的重要内容,在常见的Dijkstr和Floyd算法中,只能获取一条最短路径.在交互网络上任意节点对之间的最短路径不止一条的情况下,运用Floyd算法对已知加权交互网络的最短路径进行求解,对获得最短路径后的每一个节点对,在其中插入已知交互网络中的其余所有节点,并计算此时的节点对之间的...

Solution to shortest paths between nodes in interactive networks

The search for the shortest paths is an important part of studying the structure of interactive networks.By using common algorithms of Dijkstr and Floyd,only one path can be got in the search process.But in fact,there are more than one shortest paths between nodes in the interactive networks.Thus,the shortest paths in the weighted interaction network were calculated with the Floyd Algorithm.By inserting all the other nodes of the interaction network into each pair of nodes with the shortest path,the distanc...