搜索资源列表
Navigation
- 数据库课程设计 导航 其实就是Dijkstra算法的应用-Navigation Dijkstra
xiaoyuan
- 校园导航程序，支持任意数的顶点和边数，直接输入即可，可以查询两点间的所有路径，最短距离，Dijstra和Floyd算法都有-Campus navigation, support for any number of vertices and edges, can be directly input, you can query all paths between two points, the shortest distance, Dijstra and Floyd algorithm has
xiaoyuandaohang
- 校园导航，其中用到弗洛伊德的算法,数据结构课程设计的报告也是完整版的。-failed to translate
GuideGraph
- 简单校园导航软件，支持Dijkstra算法 -Simple navigation software campus in support of Dijkstra' s algorithm
material
- 用C++编写最短路径的算法，以及拓扑排序算法。可以用于导航等系统。-Written in C++ shortest path algorithm, as well as topological sorting algorithm. Can be used for navigation systems.
Naigation
- 处理导航数据文件，建立邻接矩阵，采用迪杰斯特拉算法实现庞大数据的简易导航功能，内含原始数据文件和导航数据文件。-processing navigation data file，the establishment of adjacency matrix,the dijkstra algorithm tosearch path.
main
- 这是一个关于校园导航系统的算法。本算法可实现在校园中进行定位、指路等功能。-This is an algorithm on campus navigation system. This algorithm can achieve positioning, guiding and other functions on campus.
INS-EKF-master
- 惯性导航 扩展卡尔曼滤波算法 来自于github-Indoor pedestrian location algorithm based on foot-mounted IMU
CampusTourGuideSystem
- 简单的校园导航算法实现，包括深度遍历等多种算法。(Simple campus navigation algorithm)
1
- 济南大学校园导航,,查询最短路径，校园景点查询，有条件最短路查询(University of Jinan campus navigation, query shortest path, campus attractions inquiry, conditional shortest path query)
校园导航系统
- 校园导航系统，用邻接矩阵和迪杰斯特拉算法(Campus Navigation System Using Adjacency Matrix and Dijkstra Algorithms)