| Article ID: | iaor2005721 |
| Country: | China |
| Volume: | 25 |
| Issue: | 2 |
| Start Page Number: | 11 |
| End Page Number: | 13 |
| Publication Date: | Jun 2003 |
| Journal: | Journal of Xiangtan Normal University |
| Authors: | Liu Daojian |
The shortest simple chain method is a versatile algorithm for solving the shortest path problem on networks. In contrast to existing methods, it can be applied to various shortest path problems on graphs, so that there will be a wider application.