SHORTEST-ROUTE METHODS .1. REACHING, PRUNING, AND BUCKETS

[1] Aho AV., 1974, DESIGN ANAL COMPUTER

[2] [Anonymous], THESIS U CALIFORNIA

[3] [Anonymous], 1973, The Art of Computer Programming

[4] Bellman R., 1958, Q. Appl. Math., V16, P87

[5] DENARDO EV, DYNAMIC PROGRAMMING, pCH1

[6] DENARDO EV, OPNS RES

[7] DIAL R, 1977, CCS291 U TEX REP

[8] SHORTEST-PATH FOREST WITH TOPOLOGICAL ORDERING [J]. COMMUNICATIONS OF THE ACM, 1969, 12 (11) : 632 - &

[9] Dijkstra E. W., 1959, Numer Math, V1, P269, DOI DOI 10.1007/BF01386390

[10] AN APPRAISAL OF SOME SHORTEST-PATH ALGORITHMS [J]. OPERATIONS RESEARCH, 1969, 17 (03) : 395 - &

[1] Aho AV., 1974, DESIGN ANAL COMPUTER

[2] [Anonymous], THESIS U CALIFORNIA

[3] [Anonymous], 1973, The Art of Computer Programming

[4] Bellman R., 1958, Q. Appl. Math., V16, P87

[5] DENARDO EV, DYNAMIC PROGRAMMING, pCH1

[6] DENARDO EV, OPNS RES

[7] DIAL R, 1977, CCS291 U TEX REP

[8] SHORTEST-PATH FOREST WITH TOPOLOGICAL ORDERING [J]. COMMUNICATIONS OF THE ACM, 1969, 12 (11) : 632 - &

[9] Dijkstra E. W., 1959, Numer Math, V1, P269, DOI DOI 10.1007/BF01386390

[10] AN APPRAISAL OF SOME SHORTEST-PATH ALGORITHMS [J]. OPERATIONS RESEARCH, 1969, 17 (03) : 395 - &