带单一限制条件的单源多权 最短路径算法及其实现

西南师范大学学报(自然科学版)

留言板

尊敬的读者、作者、审稿人, 关于本刊的投稿、审稿、编辑和出版的任何问题, 您可以本页添加留言。我们将尽快给您答复。谢谢您的支持!

姓名
	姓名不能为空！
邮箱
	邮箱不能为空！非法的邮箱地址。
手机号码
	电话不能为空！请输入有效手机号!
标题
	标题不能为空！
留言内容
	内容不能为空！
验证码
	验证码不能为空！验证码错误！

带单一限制条件的单源多权最短路径算法及其实现

带单一限制条件的单源多权最短路径算法及其实现[J]. 西南师范大学学报(自然科学版), 2000, 25(3).

引用本文:

带单一限制条件的单源多权最短路径算法及其实现[J]. 西南师范大学学报(自然科学版), 2000, 25(3).

An algorithm of the shortest path from an initial node to the other vertices with single restriction and multiple weights[J]. Journal of Southwest China Normal University(Natural Science Edition), 2000, 25(3).

Citation:

An algorithm of the shortest path from an initial node to the other vertices with single restriction and multiple weights[J]. Journal of Southwest China Normal University(Natural Science Edition), 2000, 25(3).

带单一限制条件的单源多权最短路径算法及其实现

An algorithm of the shortest path from an initial node to the other vertices with single restriction and multiple weights

摘要: 带限制条件的单源多权最短路径比一般网络中的最短路径有更加广泛的应用性.给出了仅带单一限制条件的单源多权最短路径的算法及其实现.最后给出了算法分析.
- 限制 /
- 权 /
- 最短路径
Abstract: The problem of the shortest path form an initial node to the other vertices with single restriction and multiple weights is more practical than the one with single weight. This paper proposes an effective algorithm to deal with it. The time and space complexity of the algorithm also has been discussed.
- restriction /
- weight； shortest path /