资源列表
Cluster
- 求一个小世界网络中，每一个节点的聚类系数，利用java实现。-Using java to find a small world network, each node clustering coefficient.
Dijkstra
- 利用dijstra算法求两点间的最 短路径和最短路径条数-Using dijstra Algorithm to get the shortest path between two nodes
Dancing-Links
- Dancing Links的基本操作，个类oj题目，有源代码，可以相互学习
SBT
- SBT的基本操作，个类oj题目，有源代码，可以相互学习-SBT' s basic operations, a class oj topic, source code, you can learn from each other
RMQ_LCA
- RMQ_LCA的基本操作，个类oj题目，有源代码，可以相互学习-RMQ_LCA basic operations, a class oj topic, source code, you can learn from each other
segment-tree
- 线段树的基本操作，个类oj题目，有源代码，可以相互学习-The basic operation of the tree line, a class oj topic, source code, you can learn from each other
Splay
- splay代码，各种splay的题目，和各种题目的来源以及题目的代码-Source splay code, various splay of topics, and a variety of topics and subject code
hanzhi
- 所谓汉字字模就是用0、1表示汉字的字形 文件是一个关于汉字字模的。c文件，-The so-called Chinese font is represented by 0,1 font file is a Chinese character on the character font. c file,
shenjingyuan
- 文件是一个神经元模型，对于想初学神经算法的人是一个很好的参考 -File is a neuron model, for people who want to learning neural algorithm is a good reference
question
- 包括了动态计算网络最长最短路线、网络最短路径Dijkstra算法等-Including dynamic computing network longest shortest route network Dijkstra shortest path algorithm
Tower-of-Hanoi
- 该文件包括了非递归、换位递归、汉诺塔、汉诺塔2、汉诺塔画图版、四塔、四塔2这7个c源文件-The document includes a non-recursive, transposition recursion, Tower of Hanoi, Hanoi Tower 2, Tower of Hanoi drawing version, four towers, four towers 2 7 c source files
match-of-characters
- 用朴素模式匹配算法和快速模式匹配算法实现字符串的模式匹配为题，带有详细的运行说明。-With a simple pattern matching algorithm and fast pattern matching algorithm string pattern matching the title, with a detailed descr iption of the operation.