Whenthegraphdoesn’tcontaincircuitofnegativeweight，butcontainstheedgeofnegativeweight.Dijkstraalgorithmcan’tguaranteethecorrectnessofthealgorithm.;当图中不存在负权边时，Dijkstra算法能求出每对顶点间最短路径