搜索资源列表
最小生成树prim算法
- 最小生成树的prim算法 是求图中的最短路径的一个重要算法 但是是O(n2)复杂度的一个算法-minimum spanning tree algorithm is the prim map for the shortest path algorithm of an important but is O (n2) of a complex algorithm
clonePtr
- a non-sharing smart pointer class that can be used with STL containers such as std::map, vector, list, set, and deque. The smart pointer has an assignment operator and greater than operator that call the target object s operator.-a non-sharing smart
ImproveShortestPathArithmetic
- 应用斐波纳契堆和邻接表改进单源最短路径算法，使其算法的时间复杂性由O( )减少为O（nlogn+e）,其中e为有向图的边的条数。-application Fibonacci heap and the adjacent table to improve single source shortest path algorithm, its algorithm's time complexity of O () reduced to O (nlogn e), where e is for th
BFS_DFS_Astar
- Implemented BFS, DFS and A* To compile this project, use the following command: g++ -o search main.cpp Then you can run it: ./search The input is loaded from a input file in.txt Here is the format of the input file: The firs
hyplas
- ************************************************************************ * * * * * THIS IS THE H Y P L A S 2.0 README FILE * * ----------------- * * * * HYPLAS is a finite element program for implicit small and large * * strain analisys of hyperelast
dpslam0.1.1.tar
- 机器人地图创建新算法，DP-SLAM源程序-Abstract—Probabilistic approaches have proved very successful at addressing the basic problems of robot localization and mapping and they have shown great promise on the combined problem of simultaneous localization and ma
2(2)
- 最小生成树之Prim算法 Prim算法用于求无向图的最小生成树 设图G =（V，E），其生成树的顶点集合为U。 ①、把v0放入U。 ②、在所有u∈U，v∈V-U的边(u，v)∈E中找一条最小权值的边，加入生成树。 ③、把②找到的边的v加入U集合。如果U集合已有n个元素，则结束，否则继续执行②。 其算法的时间复杂度为O(n^2) Prim算法实现： （1）集合：设置一个数组set(i=0,1,..,n-1),初始值为 0,代表对
MATLAB-control-application
- 对MATLAB软件在控制领域的应用进行了详细介绍。内容包括使用DAS工具箱函数和ActiveX控件设计数据采集与控制程序；使用串口I/O流和MSComm控件设计串口通信程序等。每种程序设计方法都提供了多个典型应用实例，每个实例都提供了线路图、详细的程序设计步骤和完整的源代码可供自动化、计算机应用、电子信息、机电一体化、测控仪器等专业的大学生、研究生及相关技术人员学习和参考。 -MATLAB software in the control area of the application in de
Lying-data-structure9
- 《大话数据结构》主要内容包含：数据结构介绍、算法推导大O阶的方法；顺序结构与链式结构差异、栈与队列的应用；串的朴素模式匹配、KMP模式匹配算法；二叉树前中后序遍历、赫夫曼树及应用；图的深度、广度遍历；最小生成树两种算法、最短路径两种算法；拓扑排序与关键路径算法；折半查找、插值查找、斐波那契查找等静态查找；稠密索引、分块索引、倒排索引等索引技术；冒泡、选择、插入等简单排序；希尔、堆、归并、快速等改进排序-" Westward the data structure," the m
find_way
- 求最地图的短路径 时间复杂度为o(n),空间也没要多大-Seek the shortest path of map Time complexity iso(n)
Matlab
- 针对经典Dijkstra算法时间复杂度问题，提出双向Dijkstra搜索算法解决智能交通路径规划问题，并通过仿真实验验证了算法的可行性和有效性(英文版资料)-Typical shortest path is Dijkstra algorithm, its time complexity is O (n 2 ). A map of the city’s road network has many nodes, if we use the Dijkstra algorithm, the time
DeepLearningDropout-master
- dropout和深度学习算法的结合使用，有详细的使用说明和数据集(Three types of layers: - C: convolutional layer (matrix map) - MP: max-pooling layer (matrix map) - F: fully connected layer (vector map) - O: output layer Convolutional Layers: - Scale: scale (size of p