资源列表
DataStructurePart3
- 学校老师上课的讲义和习题解答。这一部分关于树和二叉树。-School teachers class lectures and exercises to answer. This part on the trees and tree.
DataStructurePart4
- 学校老师上课的讲义和习题解答。这一部分是关于图。-School teachers class lectures and exercises to answer. This part is on the map.
DataStructurePart5
- 学校老师上课用的讲义和习题解答。这一部分是关于排序。-School teacher lectures and exercises with answers. This part is about the sort.
data
- 是用C语言实现的，里面有我数据结构课程设计里的算法。例如关键路径，最短路径等算法-C language is used to achieve, there are my data structure in the curriculum design algorithms. For example, critical path, such as the shortest path algorithm
Flexible_Pattern_Matching_In_Strings_Practical_On-
- 《柔性字符串匹配》的英文版，是目前讲解字符串匹配算法的参考资料中比较全面和前沿的，很有参考价值和收藏价值-" Soft string matching" in English, is the string-matching algorithm on the reference in a more comprehensive and cutting-edge, a good reference value and value to the collection
shortest1
- 这是一个关于最短路径的算法，用于计算点到点之间的最小距离。-This is a study on the shortest path algorithm, used to calculate the minimum distance between point-to-point.
Java_suanfa
- java 数据结构，一款很不错的书籍，希望对大家有所帮助。-java
N_missionaries_and_N_Savage
- 历史上著名的N教士与N野人问题，有点意思！-N missionaries with the issue of N Savage
paixu
- 基于C++的排序各种排序操作,包括快速排序,shell排序,随机排序,选择排序等-C++ based on a variety of sort of sorting operation, including the quick sort, shell sort, random order, select Sort, etc.
kruskal
- 废话少说，下面是大家都熟悉的kruskal算法，重点在于实现，时间复杂度为O(e*loge)，其中e为边数。
kmp
- kmp算法：查找一个字符串是不是另一个字符串的子串-kmp algorithm: to see whether a string is a substring of another string
UnionFind
- 并查集算法主要实现在若干个不相交集合中的两个操作：第一判断一个集合是否在另一个集合中，第二合并两个不相交的集合-A union-find algorithm is an algorithm that performs two useful operations on such a data structure:1. Find: Determine which set a particular element is in. 2. Union: Combine or merge two sets i