The problem of shortest path is very common in computer graph theory, when count the shortest path of a graph, we usually count the length of all different paths, then chose the shortest one. The computational amount is very big. And if you want to know all the shortest paths, the times of count is amazing.
When solving the problem of shortest path, we can use matrix to solve the connectivity between nodes and the number of articles in the particular length under the pathway. In this paper, by changing ...
| 
点击下列相关研究机构和相关文献作者，可以直接查到这些机构和作者被《中国知识资源总库》收录的其它文献，使您全面了解该机构和该作者的研究动态和历史。
