资源列表
WWZCM
- 编写的最短路径算法，娃娃找草莓，我改写了一下-Shortest path algorithm written doll find strawberries, complete demonstration program, study the game the shortest path or the data structures are useful.
YSHCSXWSSDH
- 用双缓冲实现无闪烁动画，基于DELPHI设计，可以调节动画速度，多线程，设计简洁。可以演示。-Double buffering flicker-free animation, design based on DELPHI, you can adjust the animation speed, multi-threaded design simple. It can be demonstrated.
HorseStack
- 本实验使用顺序栈实现驿站管理程序的编写。学会使用顺序栈存储马匹，并运用顺序栈的各种运输实现马匹的入站和出站管理.-In this study, using sequential write post stack implementation management program. Learn to use the sequence of stack storage horses, and the use of various transport stack order to achieve in
hftree
- 哈夫曼树 c++实现 哈夫曼树(Huffman Tree) 假设有n个权值{ W1，W2，…，W n }，试构造有n个叶子结点的二叉树，每个叶子结点拥有一个权值W ，则其中带权路径长度WPL 最小的二叉树，称为最优二叉树或哈夫曼树。-C++ Huffman tree Huffman tree (Huffman Tree) Suppose there are n weights {W1, W2, ..., W n}, the test structure has n leaf nodes of t
MinPath
- 最短路径的c++实现。从图中某顶点出发，沿图的边到达另一顶点所经过的路径中， 各边上权值之和最小的一条路径——最短路径：从某个源点到其余各顶点的最短路径。 -c++ shortest path implementation. A vertex the figure, the figure reaches the other side along the path through the vertex, each edge and the minimum weight of a path-
PrimTree
- 最小生成树的普里姆算法PrimTree；在一个连通网的所有生成树中，各边的权值之和最小的那棵生成树称为该连通网的最小代价生成树（Minimum Cost Spanning Tree），简称为最小生成树。 -Prim minimum spanning tree algorithm in all spanning a communication network, the weight of each side and a minimum spanning tree is called the
octomap-devel
- 一个基于八叉树的高效概率三维映射框架，主要包括OctoMap库和octovis查看器-An Efficient Probabilistic 3D Mapping Framework Based on Octrees. Contains the main OctoMap library, the viewer octovis.
ConsoleApplication4
- 集合的交并补差运算，对称差，采用链表的方式对集合进行存储，可以实现集合的检查排序和运算，模块间耦合度低，可移植性好。-Collection of occurring simultaneously senders operation, symmetry is poor, with the method of linked list to storage of collection, can realize check sorting collection and calculation, the
Graph_OP
- 该程序可以寻找通过指定节点的最优路径，基本算法是Dijkstra算法+中间节点的排列组合。该程序仅适用于节点数少于500，中间指定节点数少于20的情况.-This program can find a optimal path when source node、destination node,and some specific nodes are given.And this Program is based one Dijkstra and permutation and combinati
javasanfaorder
- java排序算法汇总：折半插入排序，冒泡算法， 异或的交换算法，直接插入排序，快速排序，简单的选择排序，希尔算法；里边有详细的解析-java sorting algorithm summary: binary insertion sort, bubble algorithm, XOR swap algorithm, direct insertion sort, quick sort, simple selection sort, Hill algorithm inside there
javaTree
- java数据结构，教你构建树结构，前序，中序，后序遍历,-java data structure, teach you to build the tree structure, the preamble, in order, after the preorder,
Data-structure-course-design
- 其中包括数据结构常用的各种的算法，比如二叉树、Prime算法等-Which includes a variety of commonly used data structure algorithms, such as the two fork tree, Prime algorithm, etc.