postgis源码

用VC++6.0开发多表联接的数据库应用程序-VC 6.0 multi-table database connectivity application

单比特树查找算法，是用于路由查找的，内含有路由查找相关资料-Monobit tree-search algorithm is used to identify the routing, which contain routing information Search

数据结构中常用的Gauss-Seidel 迭代算法-commonly used data structures, the Gauss- Seidel iterative algorithm

pb实现的气泡窗口，非常实用-pb achieve the bubble window, a very practical

图的常用算法，比较全面 并有一种求图的最短路径的算法， 欢迎指正，-map commonly used algorithms, a more comprehensive and a map for the shortest path algorithm welcome correction, thank you

数据库SQL语句应用大全-SQL database application Daquan

主要包括：建立大学数据库的源文件，已经建立好的ACCESS数据库文件，ACCESS2007教程课件，窗体使用的经验交流课件，实验报告。希望能对学习数据库的同学产生帮助-Mainly include: the establishment of the University of the database source file, well-established ACCESS database file, ACCESS2007 tutorial courseware, the form used in the exchange of experience courseware, lab report. Hopes of learning a database created to help students

自适应噪声对消源程序，LMS算法自适应滤波器仿真-adaptive noise cancellation source, LMS adaptive filter algorithm simulation

教育考试管理系统，可用于学习数据库的编写-Test management system, the database can be used to study the preparation of

(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