Created by Ya-Nan Chen at IAIR, Xi’an Jiaotong University.
华为软件精英挑战赛西北赛区32强，赛题“寻路”，找到经过必经节点的最短路径。 该代码为复赛代码，初赛稍有不同，按照要求修改即可。 算法思路参考了论文：Protected shortest path visiting specified nodes。
不需要任何第3方依赖库，可以直接在Visual studio中运行。 route.cpp 为函数功能实现总入口。
-
Notifications
You must be signed in to change notification settings - Fork 0
shortest path via specified nodes, 华为软件精英挑战赛西北赛区32强
License
chenynCV/shortest-path-via-specified-nodes
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
shortest path via specified nodes, 华为软件精英挑战赛西北赛区32强
Resources
License
Stars
Watchers
Forks
Releases
No releases published