【摘要】 Dijkstra算法被公认为解决最短路问题的最好算法 ,但它的缺陷之一是不能解决存在负权的最短路问题 .一种解决这类问题的新方法——前趋法可弥补 Dijkstra算法的这一缺陷 .实例表明 ,前趋法是一种解决存在负权的最短路问题的行之有效的简便算法更多还原

【Abstract】 Dijkstra’s algorithm of solving the shortest path problem of weighted directed graph is still regarded as the best one.However its weakness is that it can not be used to solve the shortest path problem with some negative weights.A new algorithm,called method of forward graph,can take as a saving method.更多还原