资源列表
Knight-traveled
- 数据结构算法，骑士游历问题的解决及分析说明。-Data structure algorithms, Knight traveled to problem solving and the analysis shows.
calendar
- 编写一个万年历的程序，能显现出正确的日期与星期-Write a calendar program, showing the correct date and day of the week
dice-game
- 一群小孩围城一圈扔骰子，骰子扔到的数与小孩编号一样的小孩出列，循环此动作，知道最后剩N名小孩为胜利者-The number of child ID kids out of a group of children Siege circle to throw the dice, the dice thrown out cycle this action, know the last N the child left for the winner
tsp
- 用蚁群算法解决TSP问题，快速便捷而且很全面，比较谨慎-Ant colony algorithm to solve TSP, quick and easy and very comprehensive, more cautious
conquer-and-divide-algorithm
- 本章描述了讲解了分治算法的基本思想和设计过程以及原理-Explain the basic idea and design process as well as the principle of divide and conquer algorithm described in this chapter
Floyd
- Java 弗洛伊德算法的GUI演示 数据结构课程设计-Java Floyd algorithm the GUI demo data structure curriculum design
topolopy
- 拓扑排序 Java GUI 数据结构课程设计-The topological sorting Java GUI data structure curriculum design
BubbleSort
- 数据结构课程设计 Java GUI 冒泡排序-Bubble Sort Demo in Java GUI
RatInMaze
- 数据结构课程设计 Java GUI 迷宫老鼠 非常华丽-Data structure courses design in Java GUI Rat In Maze
Shortest-path
- 最短路径 Java GUI 演示 数据结构课程设计-Shortest path to the Java GUI demo data structure curriculum design
erchashu
- 验证二叉树的二叉链表表示，实现CreateBiTree算法创建二叉树，实现二叉树的层次遍历算法，实现二叉树的先序、中序、后序递归遍历算法中的一种，编写主程序调用CreateBiTree创建二叉树，并调用二叉树的层次遍历、先（中、后）序遍历算法，测试不同的输入数据创建二叉树，预期输出并验证输出的结果。 -The binary list validation binary tree the preorder achieve CreateBiTree algorithms to create a
kmp
- 实现KMP算法 1、构建主串S和子串T,采用定长存储结构实现 2、编写主程序调用KMP算法，测试不同的输入数据S和T，输出的结果（输出模式串T的next值，以及T在S中的定位函数值。-KMP algorithm 1 to construct the main string S and substring T, using fixed-length storage structure 2, the preparation of the main program calls the KMP