worldmodel

如果发现有提示控件未注册,请运行"控件注册.bat"注册控件.-If it is found that the control has prompted unregistered, please run

最小生成树问题 若要在n个城市之间建设通信网络，只需要架设n-1条线路即可。如何以最低的经济代价建设这个通信网，是一个网的最小生成树问题。 （1）利用克鲁斯卡尔算法求网的最小生成树。 （2）实现教科书6.5节中定义的抽象树类型 MFSet。以此表示构造生成树过程中的连通分量。 （3）以文本形式输出生成树中各条边以及他们的权值。 -minimum spanning tree problem to the n-city building communications networks needed to put up only n-1 lines can be. How the lowest economic cost of building the communications network, the network is a minimum spanning tree problem. (1) using Kelushikaer network algorithm for the minimum spanning tree. (2) to achieve 6.5 textbook definition of the abstract tree types MFSet. Spanning Tree Construction said this process of connectivity components. (3) the form of text output spanning trees and the edge of their weights.

MatrixStatic一个不错的管理系统源码-MatrixStatic a good source management system

循环吗的C语言实现-cycle? C Language

数据结构往年试题及答案-Data structure in previous years questions and answers

用struts hibernate 开发的论坛源码! 开发平台:eclipese 3.1.2 web服务器: tomcat 5 数据库: mysql5.0 -Developed using struts hibernate forum source! Development platform: eclipese 3.1.2 web server: tomcat 5 Database: mysql5.0

一个用VC开发得公交车线路查询系统！-a VC development in the bus line query system!

递归算法求统计二叉树T中叶子结点的数目，数据结构常用算法-recursive algorithm for statistical binary tree T leaf node of the number of commonly used data structures Algorithm

数据结构与算法-二叉树的用法。 二叉树的主要算法，声明等。-Data structures and algorithms- the usage of a binary tree. The main binary tree algorithm, statements.

C How to Program 第12章课后练习题12，13题，可以计算多位整数，+，-，×，/，%以及求幂运算