字符串扩展问题的递归算法及动态规划算法的详细分析及实现...

一个学生管理系统的常见功能是支持个人的维护和研究信息与有关的一名学生。下面的源代码和例子用于在一个学生管理系统 PHP 和 jQuery. 在项目文件部分中列出的源代码和包含在此项目中的文件，请确保列出的源代码，该代码是否满足您的需要那里。

二路归并算法的代码,用来排序，文件后缀名是c-a program to sort files under visusl C++ s environment

三层物资管理程序源码-three source material management procedures

本人原创（delphi程序设计提高与应用）源码。本实例利用ADO组件与Access数据库连接，并可将其中的数据表中的数据生成word报表及Excel文件。源码中几乎所有的步骤都有详尽的说明，是delphi初级数据库编程人员快速进入状态的实用案例。-My original (delphi improve program design and application) source. The examples of the use of ADO components with the Access database connection, the data could be data in the table below to generate word statements and Excel documents. Source of almost all the steps are very detailed, is the primary database delphi programmers to quickly enter the state of practical cases.

北航《数据结构》PPT,内容详细，逻辑感强，适合自学-Beijing Institute of Aeronautics " data structure" PPT, and detailed, logical sense, good for self-study

使用vc进行数据库编程实例：个人通讯录管理-use vc database programming examples : personal address book management

约瑟夫环最终运行文件，适合直接使用者，不必再以来C语言来汇成执行文件。-Josephus final run files, suitable for users, having been formed to C language implementation document.

(1)输入E条弧,建立AOE-网的存储结构 (2)从源点v出发,令ve[0]=0,按拓扑排序求其余各项顶点的最早发生时间ve[i](1=2). (4)根据各顶点的ve和vl值,求每条弧s的最早发生时间e(s)和最迟开始时间l(s).若某条弧满足条件e(s)=l(s),则为关键活动.-(1) E importation of Arc lt; J, kgt; Establish AOE- network storage structure (2) v starting point source, ve [0] = 0, by topological sorting point for the rest of the earliest timing ve [i] (1LT ; = ilt; = n-1). if the Topography vertex orderly sequence number is less than net n vertices, a statement that net presence in Central, not for Critical Path, algorithm implementation steps to terminate or (3) (3) from the Department of v starting point, Vl [n-1] = ve [n-1], by the inverse order for the remaining topology of the latest occurrence of peak time Vl [i] (n-inversion; = IGT; = 2). (4) According to the apex of ve and Vl value for each s arc of the earliest timing e (s) and the latest starting time

应用背景可实现交通路线的最优路线；修建主干道路的设计路线；修建网络主干的最优路线等等都可以通过最短路径算法实现关键技术从某个源点到其余各顶点的最短路径，其中有按长度递增的迪杰斯塔拉算法，带权的迪杰特斯拉算法能有效的实现最短路线的设计

航空最短路径探测，VB调用D-aviation shortest path detection, call VB D