资源列表
4
- LinkList 单链表用头插入法建立带头结点的单链表 按值查找结点删除指定值的结点-LinkList single linked list with head node insert established to take the lead in a single linked list nodes by value Find the node to delete the specified value
shujujiegou
- 数据结构一些知识结构和考试试题，可以应对考试-Data structure of knowledge structure and examination, can cope with exams
text1
- 数据结构 c++描述 图的基本运算 如图遍历，最短路径、关键路径-The data structure c++ described in Figure basic computing Figure traversal, shortest path, critical path
Manacher
- Manacher 算法， JAVA描述 Computes the longest palindromic substring in linear time using Manacher s algorithm.-Manacher Algorithm implemented by Java Computes the longest palindromic substring in linear time using Manacher s algorithm.
Red-Black-Tree
- visual C++ 红黑树算法代码，Red and black tree algorithm-Red and black tree algorithm
river
- 一个非常详细的小马过河的源代码程序，适合初学者学习。-a horse go across the river
splaytree
- 标准数据结构splaytree的C语言实现，很规范，供参考-The standard of data structure splaytree the C language specifications for reference
optional-project-blackjact
- 经典数据结构作业，黑杰克游戏。要求程序可以连续打10次，每场比赛的赢家，赢得一个点（两点一倍）。在结束的10场比赛为你和电脑打印出的总奖金。-Write a program that simulates a simplified version of the game "BlackJack". A deck of cards numbered 2 to 10, jacks, queens, kings, and aces is used, where jacks, queens and king
hw2-poly
- c++数据结构中处理多项式加和问题源码，使用链表。配套清华版数据结构图书。-c++ data structure in processing the polynomial plus problem source, use a linked list. Supporting Tsinghua version data structure books.
CRC16
- 在VC6.0环境下用C语言编写的一个计算CRC16表格的小程序。简单实用-VC6.0 environment using C language to write a small program to calculate CRC16 form. Simple and practical
Pku_ACM_Training
- 北京大学ACM的培训资料还有相关题目的源代码。 里面涉及：组合数学、搜索、动态规划、图论、计算几何以及网络流的相关讲义及习题源代码。-Training materials as well as related topics of the Peking University ACM source code. Which involves: a combination of mathematics, search, dynamic programming, graph theory, compu
1
- 用邻接矩阵表示的图的类型 DFS：深度优先遍历的递归算法BFS：广度优先遍历判断从顶点vi到顶点vj是否可达-Adjacency matrix type DFS: depth-first traversal of the recursive algorithm BFS: breadth-first traversal of the judgment from the vertex vi to vertex vj is reachable