经典的数据结构课件，适合教学或自学用 这是我们上课时老师用的课件，感觉很好，我们也都学得不错，适合教学和自学用...

分别用行处理和串处理建立和修改文本的源程序-respectively firms and the establishment of string handling and revised version of the source

CHM decompiler is a program that converts the internal files of CHM files back into the HHP, HHC, and HHK, etc. used to compile the documentation. CHM decompiler是一个把CHM 文件的内部文件转换成 HHP, HHC,和HHK等的程序。它用于编译文件。-CHM decompiler is a program that converts the internal files of CHM files back into the HHP, HHC, and HHK, etc. used to compile the documentation. CHM decompiler is transforms the CHM document house document HHP, HHC, with HHK and so on procedure. It uses in to translate the document.

智力小蛇,贪吃蛇的强化版本,有新的玩法 原本是UC平台上的在线游戏 有双人对战模式 但没有环境只能进行单机游戏-intellectual snake, a huge memory enhanced version, The new UC rules of the original platform is the online war game with a double but did not model the environment can make single game

cpptooltip_src.zip TIP窗口的好东西。-cpptooltip_src.zip

贪吃蛇游戏 用vb2005编写的游戏程序。-Snake game written using vb2005 games.

[输入] 图的顶点个数N，图中顶点之间的关系及起点A和终点B [输出] 若A到B无路径，则输出“There is no path” 否则输出A到B路径上个顶点 [存储结构] 图采用邻接矩阵的方式存储。 [算法的基本思想] 采用广度优先搜索的方法，从顶点A开始，依次访问与A邻接的顶点VA1,VA2,...,VAK, 访问遍之后,若没有访问B，则继续访问与VA1邻接的顶点VA11,VA12,...,VA1M，再访问与VA2邻接顶点...，如此下去，直至找到B，最先到达B点的路径，一定是边数最少的路径。实现时采用队列记录被访问过的顶点。每次访问与队头顶点相邻接的顶点，然后将队头顶点从队列中删去。若队空，则说明到不存在通路。在访问顶点过程中，每次把当前顶点的序号作为与其邻接的未访问的顶点的前驱顶点记录下来，以便输出时回溯。 #include int number //队列类型 typedef struct{ int q[20] -[imported] map of the number of vertices N, Vertex map of the relationship between the starting point and end point A and B [output] if A to B without path then exporting "There is no path" Otherwise output A to B on the path vertices [storage structure] plan adopted adjacency matrix of storage. [Algorithm for the basic idea] BFS way from the vertex A, A visit followed with adjacent vertices VA1, VA2 ,..., VAK, visiting times, if not visit B, continue to visit with the VA1 adjacent vertices VA11, VA12 ,..., VA1M. VA2 and then

prolog设计的关于八数码问题的源代码，具体可能会有些问题啊-prolog eight digital design issues on the source code, there is a problem specific ah

请认真阅读您的文件包然后写出其具体功能(至少要20个字)。尽量不要让站长把时间都花费在为

将 ASM 源程序变为 TURBO-C的内联模块，将汇编语言和c语言联合使用-will ASM source into TURBO-C in conjunction with the modules will be compiled language and the joint use of language c

吉林大学时小虎老师机器学习课件――介绍动态规划-Jilin University, when the Tigers a teacher machine learning courseware- Introduction Dynamic Programming