基于改进动态规划算法的复杂网络图最短路径求解

Finding the Shortest Path in the Complex Network Based on the Advanced Dynamic Programming

通过对复杂网络图的简化,大大缩小了计算量,对动态规划进行改进,提出广义层的概念,并利用改进的动态规划算法求得经过简化的网络图的最短路径。

Predigests the network, improves the dynamic programming by presenting the conception of the broad phase, uses the advanced dynamic programming to find the shortest path of the predigested network.