FORTRAN常用算法集。

求解网络中的最短路径。假设某个计算机网络有n个站点，依次编号为1,2,…,n；有的站点之间有直接的线路连接（即这两个站点之间没有其它站点），有的站点之间没有直接的线路连接。如果用三元组（i,j,f）来表示该网络中的站点I和站点j之间有直接的线路连接且它们之间的距离为f 当已知该网络各站点之间的直接连接情况由m个三元组（i1,j1,f1）,(i2,j2,f2),…,(im,jm,fm)确定时，要求计算出对于网络中任意一个站点g(1≤g≤n)到其余各站点的最短距离。-the shortest path. Assuming a computer network n site, followed by No. 1, 2, ..., n; Some sites have direct connections (that is, between two sites are no other site), and some sites have no direct connections. If three yuan (i, j, f) to the network said the site j site and I have direct connections between them but the distance of f the network known as the site of the direct link between the situation by 3 m (i1, j1, f1), ( i2, j2, f2), ..., (im, jm, fm) to determine, calculate requirements for a network site arbitrary g (1 g n) of the rest of the site is the shortest distance.

数据库设计基础 供数据库初学者参考 比较好的资料-Database design based on reference for database beginners relatively good information

这是一款简单的ASP考试系统，可供无复杂用途的用户下载使用-This is a simple ASP web system for complex applications without the use of users to download

Visual C++ +SQL Server数据库开发与实例一书所附源代码-Visual C+++ SQL Server database development and an accompanying source code examples of

数据结构与算法分析C++描述 期末评分的东东 自己写的，有用吧・-Analysis of data structures and algorithms described in C++ to write their own final score Dongdong, useful bar

用c做的图的数据结构的作业,建立有向图,深度广度搜索,分为递归和非递归方式.-C to do with the map data structure operations, the establishment has to map the depth of breadth of search, is divided into recursive and non-recursive way.

VC环境下进行ACCESS数据库连接,查询等操作的程序,ODBC方式,适合初学者.-VC environment for the conduct of ACCESS database connections, inquiries and other operating procedures, ODBC, for beginners.

大整数整除，char *d返回余数，char*c返回结果 -Large integer divisible, char* d return the remainder, char* c return result

这是我的功课，与我的朋友。此示例数据库从 dvd 出租店。有 6 个实体，有一个关系 N N，N-1，执行查询，子查询，函数、 包，过程中，光标和触发器。

MySql，Access ADO操作数据库强大封装类 功能满足大家的需求 C++源码，有需要的下载吧