求无向图连通分支_dfs实现,很好用，希望和大家分享

人力资源管理系统（附源码），用VFP实现的，已经连编了，比较完善！-Human Resource Management System (with source code), with VFP implementation has not even compiled, and more perfect!

此为编译原理实验报告 学习消除文法左递规算法，了解消除文法左递规在语法分析中的作用 内含 设计算法 目的 源码 等等.... 算法:消除左递归算法为: （1）把文法G的所有非终结符按任一种顺序排列成P1,P2,…Pn 按此顺序执行 （2）FOR i:=1 TO n DO BEGIN FOR j:=1 DO 把形如Pi→Pjγ的规则改写成 Pi→δ1γ δ2γ … δkγ。其中Pj→δ1 δ2 … δk是关于Pj的所有规则； 消除关于Pi规则的直接左递归性 END （3）化简由（2）所得的文法。即去除那些从开始符号出发永远无法到达的非终结符的 产生规则。-to compile this report principle experiment to eliminate learning grammar rules Left delivery algorithm, left the Elimination delivery grammar rules in grammar analysis of the role of the design algorithm containing purpose algorithm source code .... etc. : Elimination left recursive algorithm : (1) grammar, of all non-G website by the end of a paramagnetic Arrange sequence P1, P2, ... Pn implementation of this order (2) FOR i : n = 1 DO TO BEGIN FOR j : = 1 DO put the shape of Pi Gamma approximate rewrite the rules 1 into Pi Gamma Gamma 2 k .... These ions 1 2 ... k ions on all the rules; Pi elimination of the direct rule left recursive END (3) Reduction from (2) from the grammar. Removing that those symbols s

数据结构课程设计，校园咨询，为来访客人提供方便查找景点，最短路等信息-data structure course design, campus counseling, visitors find convenient spots, the most short-circuit, and other information

迷宫算法程序学习，数据结构里的经典学习程序，代码经过自己的优化，加快了搜索速度-maze procedures learning algorithms, data structures of classical learning process, by its own code optimization to speed up the search process

用prim算法实验最小生成树 本程序中用到函数adjg( )，此函数作用是通过接受输入的点数和边数，建立无向图。函数prg( )用于计算并输出无向图的邻接矩阵。函数prim( )则用PRIM算法来寻找无向图的最小生成树 定义了两个数组lowcost[max],closest[max]，若顶点k加入U中，则令lowcost[k]=0。 定义二维数组g[ ][ ]来建立无向图的邻接矩阵。 -Prim algorithm using minimum spanning tree of the experimental procedures used in function adjg (), this function is through the acceptance of input points and edges, the establishment of a directed graph. Function of prg () used to calculate and output undirected graph of adjacency matrix. Function prim () is used PRIM Algorithm to find the undirected graph of the minimum spanning tree array defines two lowcost [max], closest [max], if it joined the U of k vertices, then the lowcost [k] = 0. The definition of two-dimensional array g [] [] to create a undirected graph of adjacency matrix.

Matlab 实现的 "WinPR" 文件的基础：获取更多地从图像分割评价。页 362-366 D.NAACL 打 2012 年 Scaiano M.，Inkpen原始脚本 http://scaiano.com/martin/SegEval.htmlMatlab 的适应： Juan G.法国

1、 用随机数生成的方式（要求用户输入随机数）产生一个迷宫：“1”表示墙，“0”表示路，最后的路径用“8”表示，若没有路径则打印报文，若有路径则打印出路径。 2、 通过堆栈及判断实现迷宫的自动寻找路径功能 -1, the random number generator of (requiring user input random number) produces a maze : "a" Wall said, "0" Lu said, the final path with "8" that if no path was reportedly Print text, if it were printed out trails path. 2, stack and judgment to achieve the labyrinth path function to automatically search

C#编写的OleDb数据库连接通用类库。-C# OleDb prepared by the General Class Database Connection.

匈牙利算法实现二分图最大匹配 文件输入输出.-Hungarian algorithm bipartite graph maximum matching document input and output.

将ORACLE数据库结构导出为自定义XML文件,支持整库导出,支持SDE空间库脚本导出-ORACLE database structure will be exported to a custom XML documents in support of the entire database export, to support the SDE spatial database export script