report!

Dissenyo de una BBDD con ficheros en java

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

用c++写一个售货员问题。这是高级算法中除了红黑树中最难的一个了。是研究生课程中的的程序实现-used to write a salesman problem. This is in addition to the High algorithm RED-BLACK TREE which one of the most difficult. The postgraduate courses in the program

SPLASH is a c++ class library that implements many of the Perl constructs and data types, including extensive regex regular expression pattern matching. For those not familiar with Perl, it is an excellent scripting language by Larry Wall and is available for most platforms. This Class library provides List, String, Regular Expression, and text manipulation handling capabilities based on those provided in Perl

一． 问题描述很多涉及图上操作的算法都是以图的遍历为基础的。试写一个程序，演示在连通的无向图上访问全部节点的操作。二． 基本要求以邻接多重链表为存储结构。实现连通无向图的深度和广度优先遍历。以用户指定的节点为起点，分别输出每种遍历下的节点访问序列和相应生成树的边集。-one. Description many issues involving maps of algorithms are to traverse the map-based. A written test procedures, demonstrating the connectivity of undirected graph visit all the nodes on the operation. 2. Adjacent to the basic requirements for storage of multiple linked list structure. Connectivity to the map without the depth and breadth- first traversal. User specified nodes as a starting point, the output of each node traversal visit Spanning Tree sequence and the corresponding set of edges.

采用来唯一地确定每一个非零元素，其中row、col、value分别表示非零元素在矩阵中的的行 下标、列下表和值。各数组元素的三元组按在原矩阵中的位置以行优先的顺序依次存放。在稀疏矩阵的十字链表 表示中，矩阵的的每一行设置为一个带附加头结点的循环行链表，每一列也设置为一个带附加头结点的循环列链 表。基于三元组及十字链表的稀疏矩阵乘法

C/C++语言指针使用指南,超过80%的死机现象是由于指针操作不当引起的。因而学会正确使用指针是C/C++语言使用者非常必要的一项小技能-C/C language pointer using the guidelines, more than 80% of Vista is due indicator of improper operation. So learn how to correctly use is the target C/C language users very necessary skills of a small

一个工程管理程序！我的毕业设计-a project management procedures. I graduated from the Design

这是研究生课程计算方法与技术中讲到的UnionFind算法的具体实现代码。-This is the post-graduate courses and technical calculation method described in UnionFind algorithm to achieve the specific code.

数据结构里的动态规化法，给出两个字符串的相同部分。-Data structure of the dynamics of regulatory law, given the same part of the two strings.