XMathLib是一个通用的3D图形数学库。 其中包含两个部分： XMathLib和XGeomLib。分别处理数学和几何运算。 数学部分包含向量、矩...

一个小数据库系统,具体内容为班级通讯录,比较全-A small database system, the specific contents of address book for the class to compare the whole

设计一个O(n2)时间的算法，找出由n个数组成的序列的最长单调递增子序列。-design an O (n2) time algorithm to identify by the number n of the longest sequence monotonically increasing sequences.

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

++数据库编程,详细介绍vc操作数据库的一些知识,包括dao,ado等等技术-++ Database Programming, vc detail the operation of some database knowledge, including the dao, ado, etc. technology

数据结构的java实现-data structure to achieve the java

Bellman-Ford算法 是最短路径算法的一种-Bellman-Ford algorithm is the shortest path algorithm of a

根据产品特性与需求，设置产品的条码格式，控制产品是否与工单信息相符，如不符合，则扫描FAIL,弹出提示；并按照单箱容量设置，提示满箱跟换箱号等信息提示，避免产品的短装，多装，错装现象，改善工厂产品的包装品质，将产品数据存与ACCESS数据库中，便于查询、修改等功能拓展。

以前做的课程设计,可用于学习VB与ACCESS的连接!-done before the curriculum design, learning VB can be used in connection with ACCESS!

数据结构（C＋＋版）的演示程序，详细演示归并排序的具体调用过程-data structure (C++ version) demonstration program, a detailed presentation of specific merge sorting process called

本程序用于数据结构中关于图部分的广度优先搜索和深度优先搜索。-This procedure for the data structure on the map part of the breadth-first search and depth-first search.