数据结构学习课程中的查找问题，代码简单易懂

vb多媒体数据库例子-vb examples of multimedia database

java 数据结构与算法译作者： [美]Clifford A.Shaffer著 张铭 刘晓丹译 　　包含范围：Java算法 　　尽管基本上Java图书都是讲Java本身的特性。因为Java的体系太庞大了，而用Java来实现的数据结构与算法，这本书也是唯一一本，所以尽管这本不是那么的好但还是做以推荐 -java construction of data and algorithm translated work: [ Is beautiful ] Clifford A.Shaffer inscription Liu Xiao Dan to translate Contains the scope: Java algorithm Although the basically Java books all speak the Java itself characteristic. Because of Java system too huge, but construction of data and algorithm which realizes with Java, this book also is only 11, therefore although this originally is not such is good but or does recommends

jobscope jobscope 在线求职人 1） PHP 2） mysql 数据库 3）类

vfp database interface 数据库方面的interface设计文件-vfp database interface

科研管理系统是用PoerBuilder编写-research management system is used to prepare PoerBuilder

输入学期总数 学期的学分上限 课程数 拓扑排序所形成的课程先修关系的边数 课程号及其学分 在各学期学期负担尽量均匀和 课程集中在前几个学期进行排课两种条件下进行排课-importation of the total semester credit semester courses ceiling few topological sorting as a result of the pre-course edge courses, and credits in the semester to semester burden of uniform and courses focused previous semester Course Scheduling for the two conditions under Course Scheduling

单线性链表操作 数据结构 演示 flash课件-One-way operation of the data structure of linked lists flash demo courseware

ACCESS编写的数据库维护操作平台，可以给写ACCESS程序的同志提供参考-ACCESS prepared database maintenance operation platform, you can write to the ACCESS program to provide reference comrades

求解网络中的最短路径。假设某个计算机网络有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.

欢迎使用是用Visual FoxPro 7.0数据库开发典型实例-welcomed the use of Visual FoxPro 7.0 database development typical examples