搜索资源列表
南京市部分公交转车系统
- 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
算法第一次实验
- 着色问题，输入一个图和颜色的种数，要求有邻边的两个顶点不能着同一种颜色，找出所有的着色方案-coloring, the importation of a color map and the number of categories, and a two adjacent edges of the peak is not the same color, identify all the coloring program
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
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
DBS
- 算法导轮上的伪代码写的图的深度优先 DBS具有很多特性！-algorithm guide pulley on the pseudo-code written by the depth map with priority DBS many of the characteristics!
c－均值算法
- 模式识别中的C均值算法演示程序，具体内容见说明文档，及效果图。 自我感觉还可以，请大家帮忙，提提意见。-pattern recognition algorithm in C - Means Demonstration Program, the specific content of documentation, and effectiveness map. A sense of self can, please help make a suggestion.
图形圆的生成算法
- 斜率为0～1和大于1的Bresenham画线程序，将该算法程序扩展到任一八分圆坐标空间图，从而形成一般的Bresenham画线算法。-slope of 0 to 1 and more than a line drawing of Bresenham procedures, the extension of this algorithm, arrived on January 8 pm Yuan map coordinates space, thus forming a general line
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.
turbo
- 课程设计两个程序：一：数据帧（程序每帧设置为400bit)在有扰信道传输时，采用Turbo码进行编译码。并仿真Log-MAP译码算法在不同迭代次数下的性能。 二：实现有扰信道中，不同信噪比下，采用MAP译码算法的Turbo码的性能。 以上各主程序均有做比较详细的程序注释 可直接运行turbo_main.m或LogMAP.m，稍等片刻即可观察到仿真结果 -two programs of Curriculum design : a: Data frames
Genetic
- 一個簡單的ga演算法，並有線圖產生，利用VB所寫的。-Ga a simple algorithm, and cable map production, written using VB.
turbo
- turbo码的C语言描述，MAP算法-C language descr iption of turbo codes, MAP algorithm ....
Map
- 采用C程序设计的Turbo码编解码程序，包括编码及解码程序，使用Map算法-designed with C program，Turbo encoder procedures and decoder with Map.
2p3
- turbo码高码率2/3码率的matlab编码实现，译码方式为log-MAP算法，删除矩阵为[1 1 1 0]-achieve high rate of turbo codes