How To Get Min-Cost Between two points in graph (Dijkstra’s algorithm)

How To Get Min-Cost Between twopoints in graph (Dijkstra’s algorithm) Now See This Graph : which is just like asubway map . Now Question is : how to calculate fromA to (B,C,D,E,F,G,H,I,J) min cost ? N

>>阅读原文<<