多项式与加法和乘法，链表的数据结构是美国的..

Dissenyo de una BBDD con ficheros en java

中文Access 2000 24学时教程(PDG)-Chinese Access Guide 2000 24 school (PDG)

一个功能强大的栈，用法很灵活，你会发现很有趣- A function formidable stack, the usage is very flexible, you can discover very interesting

Viterbi算法源程序,注释简洁,利于使用-Viterbi algorithm source, concise notes, beneficial use

Object-Oriented Modeling with PowerDesigner 9.5 不错的学习教案-Object-Oriented Modeling with PowerDesigner 9.5 good learning lesson plans

Computes estimates for the number of forests of a graph, input as a 0-1 incidence matrix. Notes: Compile in C++, "g++ -o span_forest span_forest.c". The program does not demand that the matrix is symmetric with 0 diagonal, but uses only the upper triangular part. -Computes estimates for the number of fores ts of a graph. input as a 0-1 incidence matrix. Notes : Compile in C, "g-o span_forest span_forest.c." The program does not demand that the matrix is symmetric wit h 0 diagonal. but uses only the upper triangular part.

这是我个人做的在vc环境下的迷宫问题的实现。各位可以参考或指教！-This is my personal vc done in the context of the realization of the maze. You can reference or enlighten!

这是一个经典的寻找最近点对的算法实现，运用VC编写，采用类的方式，是程序更易理解。-This is a classic look for the nearest point of the algorithm, using VC preparation, the type used, the way the process easier to understand.

本代码通过C++实现校园导游系统，在程序中设置了十多个地点，可查询各地点的具体信息，展示两地点之间的最短路径，展示任意一个地点到其他各地点的最短路径等。同时，也可以增添或删减节点及边，也就是可任意增加新的地点信息。

该程序能实现的功能，若活动图有回路则无法计算出关键路径，即解决了判断工程的可行性问题。通过对工程活动的输入，可以建立任意的AOE网进行判断。对于输入的网，可以计算出每个活动的最早开始时间，最迟开始时间和全工程可以完成的最早时间，并找出关键路径和关键活动。-the program can achieve the functional, if a circuit map activities can not be calculated critical path, that is a judgment to resolve the feasibility of the project. Right through the importation of construction activities, we can establish arbitrary judgment AOE network. The network for the importation can be calculated for each of the earliest start time, the latest starting time and the entire project will be completed in the first time, and identify key and critical path activities.