搜索资源列表
DFS_BFS
- java的DFS(Depth-first search )和BFS(Breadth-first search)的实现-the DFS (Depth-first search) and BFS (Breadth-first search) Implementation
Your First Cup of Java (for Win32)
- Your First Cup of Java，初学者的第一杯咖啡。-Your First Cup of Java, beginners the first cups of coffee.
深度优先搜索
- 深度优先搜索二叉树-depth-first search Binary Tree
FIRST
- 我的课程设计 一个选课系统 需要sql数据库支持 在vc6.0 和sql sever2000下编译运行通过 数据库表信息为 学生表.sql, 登陆用户名密码均为s a-my Elective courses designed a system needs sql database support in vc6.0 and sql sever2000 compiler running under the table of informat
AI_maze
- 载入txt文件迷宫，含几种搜索方法，例如depth first search, breadth first search等-maze included txt file containing several search methods, such as depth first search, breadth first search, etc.
数据结构的一些较难题答案
- 有许多是考研要用的！三路归并算法，快速排序的非递归算法，无向连通图的非递归的深度优先遍历等，，希望大家用得着-many are taking tests to use! Three road merging algorithm, rapid sequencing of non- recursive algorithm, undirected graph of the non- recursive depth-first traversa
CFF1.5
- 编译原理中的First集与 Follow集生成程序，这是我用C＋＋语言写的，希望对大家有点用处。-Compiler Principle of First Set and Follow procedures set generation, which is my C++ languages, we hope to somewhat useful.
基于AI的问题求解
- 提供了深度优先搜索,广度优先搜索,添加启发信息的最小代价搜索,查找多个解,查找最优解的范例程序.-a depth-first search, breadth- first search, add the information inspired the minimum price for a search of solutions to search, find out the optimal solution sample progr
实验二：ll1语法判断
- 实验二：LL1语法判断 自定义一个文法集，输入文法产生式，计算文法的FIRST，FOLLOW和SELECT集合， 利用SELECT集合构造预测分析表，接着用预测分析程序，栈 和预测分析表对输入串进行分析，给出分析过程-Lab two: The LL1 grammar judgment from defines a grammar collection, the input grammar production pattern, co
判断是否为ll(1)文法程序
- 一个程序，用于判定给定的文法是否为LL（1）文法。 实现了：1．文法的机内表示；2. FIRST集和FOLLOW集的计算； 3. LL（1）预测分析表的构造。-a procedure for the determination of grammar to whether LL (1) grammar. Realized : 1. Grammar said the machines; 2. FIRST FOLLOW sets and se
BDFS
- 用邻接表表示无向图的深度优先搜索遍历 有助于大家理解图的优先遍历问题-adjoining table with no plans to the depth-first search traverse help you understand the plans of the priority issues Traversing
深度优先搜索、广度优先搜索
- 图的深度优先搜索和广度优先搜索。值得一看。-map the depth-first search and breadth- first search. An eye-catcher.
8连通
- 计算8连通区数量 利用深度优先遍历，并对同一8连通区进行标记，当遇到不属于同一连通区且灰度符合要求的则计数加1，分别考察一个点周围的八个点。-8 COMPONENTS calculated using the number of depth-first traversal, and the same eight areas marked connectivity, when they do not belong to the sam
hsdfhjshdj
- 对深度优先(Depth first) 、宽度优先(Breath first) 、爬山法(Hill Climbing) 、 最佳优先(Best first) 以及A*搜索算法进行分析比较，要求： 给出这几种算法的描述； 根据SearchDemonstration程序中给出的示例，给出各算法的执行过程-priority right depth (Depth first), the width of priority (Breath
predictAnalysis
- 本程序主要实现预测分析表的构造，并求first和follow集-the procedure main table Forecast and Analysis, and the construction and follow for first set
RBFS_CODE
- RBFS算法（递归最佳优先搜索：A*家族）和LRTA*算法（联机局部搜索，又名实时学习A*搜索，同为A*家族）实现图的单源最短路径。其中RBFS和LRTA*算法均比狄杰算法效率高！ -RBFS algorithm (recursive best first search :* A family) and the LRTA* algorithm (online local search, also known as real-time
Judge_LL(1)
- 本设计使用C语言实现了对简单方法描述的LL(1)文法的判定。该设计程序实现了：⑴分别求出每一产生式的右部的FIRST 集、每一个非终结符的FOLLOW集和每一产生式的SELECT集；⑵判定是否是LL(1)文法；⑶画出预测分析表；⑷对给定的符号串判定是否是文法中的句子，分析过程在屏幕上打印出来。 欢迎大家给程序提出富贵意见!-the design of the C language to describe a simple metho
FPS
- 用OpenGL实现的第一人称射击First Person Shooter(FPS)游戏demo-use OpenGL the first-person shooter First Person Shooter (FPS) game demo
LL1ForXp
- LL(1)文法，消除隐藏左递归，提取共因子，然后求First,Follow,Select集，以及预测分析表,最后进行预测分析-LL (1) grammar, the elimination of hidden left recursive, extracting a total factor, and then seek First, Follow, Select set, and the forecast analysis table
fifoexe
- 本程序包括求First集和Follow集的VC++原程序，已经编译过可以直接使用。-including procedures for the First Set and Follow Set VC program, it has been compiled using direct.