| 状态转移问题的数学模型浅析 |
| |
| 引用本文： | 李建龙.状态转移问题的数学模型浅析[J].河南机电高等专科学校学报,2005,13(6):44-45,63. |
| |
| 作者姓名： | 李建龙 |
| |
| 作者单位： | 扬州职业大学,江苏,扬州,225002 |
| |
| 摘 要： | 解决一个问题时往往会发现问题里设置了不少的障碍，如何把各个障碍分离，以免引起不必要的干扰，这是一个关键。这里讨论了如何建立一个问题中状态转移关系的数学模型以及如何寻找最短路径的方法。
|
| 关 键 词： | 渡河 有序对 通路 最短路 Dijkstra算法 |
| 文章编号： | 1008-2093（2005）06-0044-02 |
| 收稿时间： | 05 13 2005 12:00AM |
| 修稿时间： | 2005-05-13 |
Simple Analysis on Mathematical Model about Problem of State Transfer |
| |
| LI Jian-long.Simple Analysis on Mathematical Model about Problem of State Transfer[J].Journal of Henan Mechanical and Electrical Engineering College,2005,13(6):44-45,63. |
| |
| Authors: | LI Jian-long |
| |
| Affiliation: | Yangzhou Polytechnic College,Yangzhou 225002, China |
| |
| Abstract: | Many obstacles can often be found when solving a certain problem.It's a key point to separate each obstacle lest setting off unnecessary interference.This paper simply discusses how to build Mathematical Model on State Transfer,in a certain problem and the method how to search for the shortest route. |
| |
| Keywords: | Crossing a River ordinal couplet route the shortest route Dijkstra algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
