资源列表
simkd
- kd树的最快实现算法，经过了数次优化后，即使处理数十万个点，也仅仅需要几秒钟，内含使用说明。-kd tree algorithm to achieve the fastest, after a number of optimization, even hundreds of thousands of points. I only need a few seconds, intron use.
mataqipan00122121
- 这是数据结构的一个课程设计.马踏棋盘,其中包含两种算法.一种只有一条路线,另一种有多条路线.还有设计文档.希望对大家有用.-This is the data structure of a curriculum design. Horse riding chessboard. which includes two algorithms. Only one of a line, A number of other routes. There design documents. We hope tha
paihuange
- 有二叉树的排列,建立,删除和排序等操作,包括彩旦-a binary tree with creation, deletion and scheduling and other operations, including Caidan
oulat
- 欧拉图的使用，和它的源码，还有欧拉图的原理和解释，希望大家能用到-Graphs use, and its source code, there is a graph theory and explained that the hope that everyone can be
2501425708
- 此程序用提升法实现第二代小波变换 ％％ 我用的是非整数阶小波变换 ％％ 采用时域实现,步骤先列后行 ％％ 正变换：分裂，预测，更新； ％％ 反变换：更新，预测，合并 ％％ 只做一层（可以多层，而且每层的预测和更新方程不同）-the procedure used to upgrade method is the second generation wavelet transform%% I use a non-integer-order wavelet transform%%
puzzle_dev_c
- 经典迷宫算法，效率高。适合初学者熟悉数据结构的堆栈。-classic maze algorithm, high efficiency. For beginners familiar with the data structure of the stack.
MMA32
- 一种盲均衡算法的matlab仿真程序 信道为多经信道-a blind equalization algorithm Matlab simulation program for multi-channel by channel
ImproveShortestPathArithmetic
- 应用斐波纳契堆和邻接表改进单源最短路径算法，使其算法的时间复杂性由O( )减少为O（nlogn+e）,其中e为有向图的边的条数。-application Fibonacci heap and the adjacent table to improve single source shortest path algorithm, its algorithm's time complexity of O () reduced to O (nlogn e), where e is for th
MinHeapimplementmintree
- 数据结构中，主要是运用最小堆，实现最小代价生成树-data structure, the main use is the smallest pile, to achieve the minimum price Spanning Tree
suanfa
- 这是我今年数据结构的课程设计，课题是实现冒泡排序，快速排序，直接插入排序，直接选择排序的算法比较 绝对原创哦-This is my data structure of this curriculum design, the task is to achieve bubble sort, quick sort, direct insertion sort, directly choose Sort Algorithm relatively absolute originality oh
FibonacciHeap
- 斐波那契堆基于二项式堆,在支持以O(1)时间实现插入、合并和以O(log n)实现删除最小元素的基础上，进一步实现了以O(1)实现指定节点值减少和用O(log n)时间完成删除任意节点操作-Fibonacci heap-based binomial heaps of support to the O (1) time to achieve insertion, Merger and O (log n) to achieve the smallest element deleted on the
dataandstructure
- 送给大家的新年礼物,关于数据结构的东西,希望能给你大家写帮助.-gave you for the New Year gifts, the data structure of the things that would give you to help you to write.