资源列表
36xuan
- 36选7全部号码不重复须运行程序才能产生可能花长时间才有-All 36 select 7 numbers
jiapu
- 这是一个电子家谱系统，是数据结构的课程设计，非常适合大学本科生，含源码-This is an electronic pedigree system, a data structure of the curriculum design, ideal for undergraduate students, including source code
shujujiegou
- 这是数据结构的实验或者课程设计，包括二叉树、链表等基本结构，含源码-This is a data structure of the experiment or curriculum design, including binary trees, linked lists and other basic structure, including source code
cPPmath
- c++两个算法，自己经过测试，对于初学者有帮助-c++ two algorithms, they are tested, there is help for beginners
KDTreeprogramVC
- kd树的算法实现,用VC写的，比较详细，大家参考-kd tree program
dijkstra
- Dijkstra,, finding the short path depend on the costs
Test
- 一个C++例子程序，同时涉及到C中的链表和C++中的类。 增加了一定的注释。-A C++ example programs, and related to the linked list in C and C++ classes. Add some comments.
rank-of--100--meter-race-
- 某大学开田径运动会，现有12名选手参加100米比赛，对应的运动员号及成绩如表所示，请按照成绩排名并输出，要求每一行输出名次、运动员号及成绩。要求用冒泡法排序。-To open a university track and field sports, currently has 12 players to participate in 100m, corresponding to the number of athletes and the results shown in the table,
cPP
- 主要是C++链表和指针的一些基本操作，初学的时候写的。-Mainly C++ linked list and some basic pointer operations, beginner' s time to write.
Dijkstra
- Dijkstr的最短路径算法，实现功能是应用Dijkstra算法求图上二顶点之间的最短距离。-Dijkstr the shortest path algorithm, Dijkstra' s algorithm is applied to achieve functional requirements map the shortest distance between two vertices.
cut-the-minimum-cut-problem
- cut 最小割问题 网络G=(V,E)的割cut(S,T)是将G的顶点集V划分为2个不相交的子集S和T，使s Î S ， t Î T ，且cut(S,T) = {(u,v)Î E | u Î S,vÎ T}。设每条边(u,v)的边权为a(u,v),则割 cut(S,T)的权值为cut(S,T)中所有边权之和。最小割问题要求网络G 的权值最小的割。-cut the minimum cut problem network G = (V, E)
diam-diamond-mine-issue
- diam 钻矿问题 已探明某钻石矿区中钻石的分布情况，如图1 所示。要开采出全部钻石就要挖掘通往所 有钻石埋藏地点的矿道。矿道可以沿着东南西北4个方向挖掘。每一矿道可以连接多个钻石 埋藏点。按照矿道施工要求，可以平行开挖矿道，但不允许交叉。钻矿问题要求对于给定的 钻石分布，设计一个矿道长度总和最小的挖掘矿道方案-diam diamond mine issue has proven a diamond mine in the diamond distribution, shown in