WordPress博客系统，可以自由改变中文版，没有钱…

一种基于二维链表的稀疏矩阵模半板类设计 A template Class of sparse matrix. Key technology: bin,2-m linked matrix. constructors: 1.normal constuctor 2.copy constuctor. 3.assignment constructor. Basic operator: 1. addition(sub) of two matrix 2. inverse of a matrix. 3. multiply of two matrix. etc.-based on two-dimensional chain of sparse matrix model semi-plate design of Class A"s template parse matrix. Key technology : bin. 2-m linked matrix. constructors : 1.normal constuctor 2.copy constuctor. 3.ass ignment constructor. Basic operator : 1. addition (sub) 2 matrix of two. inverse of a ma trix. 3. multiply of two matrix. etc

文章详细讲解分支限界的基本思想，单元最短路径问题，装载问题，0-1背包问题，旅游售货员问题等。-Detailed article on the basic idea of branch and bound, the shortest path problem unit, loading issues ,0-one knapsack problem, travel salesman problem.

使用动态规划的方法求接出怎样在两条装配线上以最快的时间完成装配任务-The use of dynamic programming methods for how to access the assembly line in the two shortest time to complete the assembly task

操作Ado，得到数据信息，包括表信息、字段信息-Get Database infomation , about Table or Fields.

Axion 是一个小型的，快速的SQL和JDBC 适应的关系数据库引擎，由JAVA编程语言编写并且用于JAVA语言。-Axion is small, fast SQL and JDBC adapt the relational database engine, and uses in the JAVA language by the JAVA programming language compilation.

用VC odbc连接Access数据库，简单！

实现各种内部排序。包括冒泡排序，直接插入排序，Shell排序，快速排序，堆排序，并比较排序的比较次数和移动次数。主要是C语言。-achieve internal order. Including bubble sort, direct insertion sort, Shell sort, quick sort, heap sort, and compare the ranking of number and mobile number. C is the main language.

数据结构演示系统-data structure Demonstration System

金蝶K3数据字典 K3erp数据库 表结构 -K3 Kingdee K3erp data dictionary database table structure

1 创建给定图的存储结构，从邻接表和邻接矩阵两种存储方式中选择一种。 2 对所创建的图进行深度和广度优先搜索遍历，给出遍历过程中的顶点序列。 3 求图的最小生成树，按构造顺序输出边的序列。（两种方法都要求！） -Create a storage structure of a given graph from the adjacency list and adjacency matrix are two ways to choose a store. Two pairs of maps created by the depth and breadth-first search traversal, given the culmination of the process of traversal sequence. 3 order to map the minimum spanning tree, according to the order of the output side of the sequence structure. (Both methods require!)