学生管理系统

网站，主要应用学校外语系的组织机构，党团组织，学生生活，学习情况等-Web site, the main application of the school foreign language department of the organization, party organizations, student life, learning, etc.

最短路径问题C++描述-Shortest Path Problem Description C

VC6.0下开发的Access数据库小区管理系统-VC6.0 developed under the Community Access database management system

像小卡片一样的日历,包括星期-like small cards the same calendar, including the week

细胞生长的源码，使用VC描述，适合研究数据结构-Cell growth source, the use of VC descriptions, research data structure suitable for

最段路径的算法 dijkstra算法，用C++编写-The dijkstra algorithm path segment algorithm, using C++ to prepare

针对多维数据进行的Kmeans改进算法，实用可靠，在处理多维数据时，自己根据维数需求，进去设定n值，此程序较适合底层应用用，另sizevector的数据都需要注意，在用时根据自己的需求进行操作，内有程序详细说明

最小生成树问题 若要在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.

f 有代码在您的描述，请使用"插入代码"按钮要插入代码并选择编程语言。这会使你美丽的源代码和 attractive.f 有是在你的描述的代码，请使用"插入代码"按钮要插入代码并选择编程语言。这会使你美丽的源代码和 attractive.f 有是在你的描述的代码，请使用"插入代码"按钮要插入代码并选择编程语言。这会使你美丽的源代码和 attractive.f 有是在你的描述的代码，请使用"插入代码"按钮要插入代码并选择编程语言。这将使您的源代码美丽和有吸引力。

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