| 最短路径及其求法 |
| |
| 引用本文： | 孟祥云.最短路径及其求法[J].唐山学院学报,2002(2). |
| |
| 作者姓名： | 孟祥云 |
| |
| 作者单位： | 河北理工学院轻工分院 河北唐山063000 |
| |
| 摘 要： | 最优问题同图论中的最短路径问题等价 ,计算最短路径的较好算法是由 B.W.Dijkstra给出的标号法。以分步计算最后归纳为表格的方式叙述此算法
|
| 关 键 词： | 最短路径 标号法 带权图 |
Minimal Path and Its Solution |
| |
| MENG Xiang,yun.Minimal Path and Its Solution[J].Journal of Tangshan College,2002(2). |
| |
| Authors: | MENG Xiang yun |
| |
| Abstract: | The optimal problem is equal to that of minimal path.The better solution of minimal path is labeling method given by B.W. Dijkstra,which is described as calculating step by step,then summing up in table form. |
| |
| Keywords: | minimal path labeling method weighted graph |
| 本文献已被 CNKI 等数据库收录！ |
