搜索资源列表
netlayer
- VC+MO最短路径算法 // 计算线的几何长度 double CalcLength() // 通过线的id得到线数据 BOOL GetLineData(int id) // 得到距离某点最近的线段，返回该线段的id int GetNearestLineData( double x, double y) // 判断两点是否重合 BOOL IsPtCoincide( NetPoint ptFirst, NetPoint ptSecond ) /
Neobus0.1-2
- 北京公交信息查询 VC＋MapX GIS二次开发 最短路径，公交换乘
DigitalMap
- VC++开发广州市交通运输干线，利用底层开发模式，实现简单的网络分析和路径分析功能-VC++ Development Canton City transport lines, the use of the underlying pattern of development, the realization of a simple network analysis and path analysis
LabeledIconWndDemo
- 使用VC++编写的城市间最短路径问题的演示程序，具有图形化界面，采用Dijkstra算法，能够生成任意两个城市间的路径长度和具体路径。-This project is programmed in VC++ to demonstrate a demo which solves shortest path problem between two cities。This program has a city network GUI, utilizes Dijkstra algorithm and c
DemonstrationPlatform
- 利用A star和人工势场法做的无人机路径规划。在VC下实现，可设置威胁区域和动态威胁。-A star and the use of artificial potential field do UAV path planning. In the VC, can be set to threaten regional and dynamic threats.