MST_Kruskal

本设计完成了要求的所有功能，可由系统建立一张图或者由用户自行建立一张图,并对该图进行关键路径的搜寻.用户界面友好，有用户使用说明,每一步操作都有说明与提示。程序运行通过，有详细的解释说明。-the design completed all the required functions, from the establishment of a system or plan established by the users themselves a map, and this map critical path of the search. User friendly interface, users note, every step of the operation have notes and hints. Running through a detailed explanation.

这份是数据结构的一些资料，里面内容相对比较简单，但却非常值得一看～-This is some of the information data structure, which content is relatively simple, but very much worth a visit ~

前k条最短路径（KSP）算法在国内鲜有研究，本压缩包中文献整合了自1971年此问题被提出后几十年来的论文共25篇。 其中以Martin先生的删除（Delelte）算法与Yen先生的背离（Devation）算法为主。 其中所有文献均来自网络。含有两篇中文文章以及23篇英文文章。 算法的复杂度基本控制于O(logn)内-Pre-k shortest paths (KSP) algorithm in the domestic few studies in the literature in this compressed package integration since 1971, this issue has been moved for several decades a total of 25 papers. Among them, Mr. Martin removed (Delelte) algorithm and Mr. Yen departure (Devation) algorithm is based. In which all documents are from the network. Contains two Chinese articles and 23 articles in English. The complexity of basic control algorithms in O (logn) in

这是我的数据结构课程设计源代码，请务必按提示输入数据，该程序的功能是用链表实现多项式的四则运算。-This is my data structure course design source code, you must follow the directions to input data, the program"s function is used to achieve Chain of four polynomial operations.

此为编译原理实验报告 学习消除文法左递规算法，了解消除文法左递规在语法分析中的作用 内含 设计算法 目的 源码 等等.... 算法:消除左递归算法为: （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

实现哈夫曼编码译码，可以实现，本实验可以实现编码，译码，打印哈夫曼数，等-There is a chance to appreciate different ways of life.

/**************************************************************************************  * Dragonfly - RTMP Server by ActionScript  *   * Author: SnowMan  * Author QQ: 228529978  * BLOG: http://rtmp.net or http://rtmp.us.to  * Copyright(c) AS-RTMP-Server(Dragonfly) 2012  * SourceCode URL: http://code.google.com/p/as-rtmp-server  *  *  * Licence Agreement  *

JAVA源代码反编译超级引挚 -Java source code compiler- super engine

xml数据库，实现查插删改，JAVA SWING作界面-xml database, interpolation search for Modifications to realize, JAVA SWING for interface

电脑排课(普通不过的)-course timetable by computer(very normal)