资源列表
Thinning-Algorithm_3D
- thinning algorithm in 3D
RailSystem
- Traveling through Europe by rail is a cheap and effective way to experience the sights, sounds, and culture of a wide array of countries and cities. Generally, travelers purchase rail passes that allow unlimited travel on the rail system. Individual
K-means
- K-means算法是很典型的基于距离的聚类算法，采用距离作为相似性的评价指标，即认为两个对象的距离越近，其相似度就越大。这是一本介绍K-means算法的英文书籍 -K-means algorithm is very typical distance-based clustering algorithm, using distance as the similarity evaluation, that the closer the two objects, the greater the s
MergeSort
- 代码的功能：用C语言实现归并排序的算法，代码中带有详细的注解，十分有利于阅读和改进来应用于自己的算法。归并排序法是将两个有序表合并成一个新的有序表，即把待排序序列分为若干个子序列，每个子序列是有序的,然后再把有序子序列合并为整体有序序列。-The functionality of the code: merge sort algorithm, implemented in C code with detailed comments, and very conducive to reading a
xiaoyuan
- 校园导航系统,数据结构课程设计，可以当作范例。-school guide system
BCJR
- This an algorithm for something that is not command to see.-This is an algorithm for something that is not command to see.
nodeDispcutBatchRt
- ABAQUS中节点各属性显示的fortran代码，可以修改内部显示参数-Fortran code ABAQUS in the node properties displayed, you can modify the display parameters within
tfrsp
- 实现信号的时域和频域变换的一种算法，附有详细说明-Signals in time domain and frequency domain transform an algorithm, with detailed instructions
Group
- 1.建立并显示图的邻接矩阵。 2.建立并显示图的邻接表。 3.实现图的深度优先和广度优先遍历。 4.实现最小生成树的算法。 5.实现拓扑排序算法。-(1) to establish and show the adjacency matrix. 2 and displays the adjacency table. Depth first and breadth-first traversal of the graph. (4) to achieve the minimum
BiTree
- 1.定义二叉链表类型，建立二叉树。 2.先序遍历二叉树，并输出遍历结果。 3.中序遍历二叉树，并输出遍历结果。 4.后序遍历二叉树，并输出遍历结果。 5.层次遍历二叉树，并输出遍历结果。 6.求二叉树的深度、总结点数、叶子结点数、二叉树的复制。-(1) define a binary linked list type, the establishment of a binary tree. 2 preorder traversal of binary tree, a
New
- 最短路径新算法，程序速度特快，3万节点，35000条路全部遍历，只需1秒。-New shortest path algorithm, the program speed of the express, 30,000 nodes, 35,000 road traversing all, just 1 second.
migong
- 以一个M*N的长方阵表示迷宫，分别用0和1表示迷宫中的通道和障碍。设计一个程序，对任意设定的迷宫，求出一个从入口到出口的通路。-A M* N matrix that long labyrinth of 0 and 1 respectively, said the maze of channels and barriers. Designing a program, for any set of the maze, find a pathway from the entrance to the e