资源列表
Barber-shop-simulation
- 数据结构设计程序之理发馆仿真，便于初学者-Barber shop simulation of the data structure design process, easy for beginners
Traffic-Advisory-System
- C语言编写的全国交通咨询模拟系统，文件包含最好用最全的源码，是本人编写的数据结构课程设计的代码。-National Transport Advisory analog system written in C language, the file contains the best and most complete source code I write the data structures course.
mowangLanguage
- 有一个魔王总是使用自己的一种非常精炼而抽象的语言讲话，没有人能听懂。但他的语言是可以逐步解释成人能懂的语言的，因为他的语言是由以下两种形式的规则由人的语言逐步抽象上去的： (1) α→β1β2 …… βm (2) (θδ1δ2 …… δn)→ θδnθδn-1 …… θδ1 θ -A devil always use a very refined and abstract language speech, no one can understand. But his languag
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