Description: Minimum spanning tree.cpp
If You have a connected, undirected graph, a spanning tree
of that graph is a subgraph which is a tree and connects
all the vertices together.
Here You can do it with in C++ Language. Platform: |
Size: 1024 |
Author: |
Hits:
Description: 最小生成树是一个有 n 个结点的连通图的生成树是原图的极小连通子图，且包含原图中的所有 n 个结点，并且有保持图联通的最少的边。
本程序生成一个最小生成树-Minimum spanning tree is a n-node connected graph of the minimal spanning tree is the original connected subgraph, and contains all the n original nodes, and there are plans to maintain at least the edge of Unicom. This procedure generates a minimum spanning tree Platform: |
Size: 2048 |
Author:darkmoon |
Hits:
Description: 本程序是基于最小洗漱树的分类器 可得到分类效果不错的分类器-This procedure is based on a minimum wash tree classifier good classification results obtained classifier Platform: |
Size: 1024 |
Author:zhouqian |
Hits:
Search - MINIMUM_SPANNING_TREE