- qwer 一个简易的登陆系统的例子
- HuffmanTree.rar 哈弗曼树
- flash-zhibo-yuanma flash流媒体直播系统 源码
- Anime-Pictures-(PD) Anime JPEG Pictures with music for gba
- GA-example easy genetic algorithm method example by matlabcode explain
- 2017_10_28_stm32f030_dev_v1_nrf24_hse 基于stm32f030f4p6的nrf24l01通信(NRF24L01 communication based on stm32f030f4p6)
资源列表
calculator-algorithm
- 数据结构设计程序之计算器的算法实现，很适合初学者学习-Data structure design procedures calculator algorithm, it is suitable for beginners to learn
f
- 用栈和队列实现的回文判断源代码 数据结构书中的c++实现-by c++
3
- 数据结构书中 的最短路径 c++源代码 可以参考一下-by c++
Screening-method
- 选择排序 排序问题中的蛮力法 算法设计与分析-Selection sortThe scheduling problem with the brute force methodDesign and analysis of algorithms
floyd
- Floyd算法又称为弗洛伊德算法，插点法，是一种用于寻找给定的加权图中顶点间最短路径的算法。-Floyd algorithm, also known as Freud algorithm, interpolation point method, is a given weighted graph to find the shortest path algorithm vertices.
RadixSort
- this code ....RadixSort
Range-search-of-Binary-search
- 使用折半查找法来确定一定范围，即折半查找的范围查找。-Use binary search to determine a certain range, ie, a binary search range to find.
Data-structure
- 数据结构课程设计 包括单链表,二叉树,拓扑排序,最小生成树,内部排序,表达式求值-The data structure curriculum includes the singly linked lists, binary trees, topological sort, minimum spanning tree, internal sequencing, expression evaluation
Kruskal.zuixiaoshengchengshu
- 若要在n个城市之间建立通信网络，只需要架设n-1条线路即可。如何以最低的经济代价建设这个通信网，是一个网的最小生成树问题-To establish communication networks between n cities, only need to set up the n-1 lines can be. The lowest economic cost of construction communication network is a network of minimum spanni
(Kruskal
- 若要在6个城市之间建立通信网络，只需要架设5条线路即可。如何以最低的经济代价建设这个通信网，是一个网的最小生成树问题-To establish communication networks between 6cities, only need to set up the 5 lines can be. The lowest economic cost of construction communication network is a network of minimum spanning tr
zuixiaoshenchengshushili
- 若要在n个城市之间修路，只需修n-1条线路即可。如何以最低的经济代价建设，是一个网的最小生成树-To n-1 lines, to between n cities, roads, just repair. The lowest economic cost of construction, the minimum spanning tree of a network
fzxj
- 分支限界法解决单源最短路径问题(xiaodan)-Branch and bound method to solve the single source shortest path problem (xiaodan)