搜索资源列表
南京市部分公交转车系统
- a)需求分析： 任务：建立南京主要公交线路图。 要求：输入任意两地点，给出最佳的乘车线路和转车地点。 b)概要设计： 本程序所使用的数据结构是树和线性表，所使用的算法主要有堆排序、赫夫曼算法。 -a) Requirements Analysis : Mandate : the establishment of the Nanjing main transit route map. Requirements : 2 importation arbitrary locations
AOE
- 采用数据结构中的AOE方法对图的关键路径进行计算，此算法摘录了课本中的算法-using the data structure to map AOE method of calculation of critical path, this algorithm extracts from the books of Algorithm
path_VtoU&
- 求图中从一个顶点到另一个顶点的一条路径。 //为简化算法，没有提供顶点到其编号的转换函数，函数Path_vtou(ALGraph G,VexIndex v,VexIndex u) //中两顶点参数用的是顶点的编号；函数Printpath(ListType Path)输出的是路径上的顶点编号序列-seeking a map from the vertex to another vertex of a path. / / To simplify the algorithm, not to i
FindSuperwayFunction
- 本程序利用数据结构中的回溯算法的非递归对以知地图进行全路线查找，可以完成最短路线，最少费用，和所有路线的显示-procedures for the use of the data structure of the back - recursive algorithm right to know what the road map for the entire search, the shortest route to be completed, at least cost, and all th
Assign01c
- Maze algorithm, to find the path in a maze map.
shujujiegou__c++
- c++编的几个数据结构代码。包括AVL树、二叉搜索树、二叉树、Kruskal算法和图的邻接表表示-c addendum to the few data structure code. Including AVL tree, binary search tree, binary tree, Kruskal map algorithm and the adjoining table
Binary_Search_Tree
- c++编的几个数据结构代码。包括AVL树、二叉搜索树、二叉树、Kruskal算法和图的邻接表表示-c addendum to the few data structure code. Including AVL tree, binary search tree, binary tree, Kruskal map algorithm and the adjoining table
tudelinjiebiaobiaoshi
- c++编的几个数据结构代码。包括AVL树、二叉搜索树、二叉树、Kruskal算法和图的邻接表表示-c addendum to the few data structure code. Including AVL tree, binary search tree, binary tree, Kruskal map algorithm and the adjoining table
Kruskal_suanfa
- c++编的几个数据结构代码。包括AVL树、二叉搜索树、二叉树、Kruskal算法和图的邻接表表示-c addendum to the few data structure code. Including AVL tree, binary search tree, binary tree, Kruskal map algorithm and the adjoining table
Binary__Tree
- c++编的几个数据结构代码。包括AVL树、二叉搜索树、二叉树、Kruskal算法和图的邻接表表示-c addendum to the few data structure code. Including AVL tree, binary search tree, binary tree, Kruskal map algorithm and the adjoining table
AVL___Tree
- c++编的几个数据结构代码。包括AVL树、二叉搜索树、二叉树、Kruskal算法和图的邻接表表示-c addendum to the few data structure code. Including AVL tree, binary search tree, binary tree, Kruskal map algorithm and the adjoining table
general
- MAP algorithm function
DBS
- 算法导轮上的伪代码写的图的深度优先 DBS具有很多特性！-algorithm guide pulley on the pseudo-code written by the depth map with priority DBS many of the characteristics!
Dijkstra_c
- C#中实现最短路，该图算法描述的是这样的场景：图由节点和带有方向的边构成，每条边都有相应的权值，路径规划（最短路径）算法就是要找出从节点A到节点B的累积权值最小的路径。-achieve the most short-circuit, the algorithm described in the plan that is the scene : map with nodes and from the direction of the edges, and each side has a corre
max-log-map.zip
- max-log-map算法的C语言的实现，能计算出所需要的LLR，做出软判决和硬判决。,max-log-map algorithm for the realization of the C language, can be required to calculate LLR, make a hard decision and soft decision.
suanfa
- 实现识别标识符的状态转换图算法。掌握识别标识符的状态转换图的理论知识和算法实现。-Identifier to achieve recognition of the state transition map algorithm. Master identifier to identify the state transition graph theoretical knowledge and algorithms to achieve.
map
- speech recognition speaker adaption map algorithm
turbo
- 课程设计两个程序：一：数据帧（程序每帧设置为400bit)在有扰信道传输时，采用Turbo码进行编译码。并仿真Log-MAP译码算法在不同迭代次数下的性能。 二：实现有扰信道中，不同信噪比下，采用MAP译码算法的Turbo码的性能。 以上各主程序均有做比较详细的程序注释 可直接运行turbo_main.m或LogMAP.m，稍等片刻即可观察到仿真结果 -two programs of Curriculum design : a: Data frames
turbo
- turbo码的C语言描述，MAP算法-C language descr iption of turbo codes, MAP algorithm ....
FSTCEF
- 连续介质有限应变弹塑性分析Fortran程序，采用“返回映射”算法，包含验证算例，做一些修改可用于复杂结构的大位移分析。-fortran source code of finite strain theory for continum elasto-plasticity, return map algorithm