Find-MST
所属分类：论文
开发工具：C++
文件大小：444KB
下载次数：0
上传日期：2022-05-12 11:02:22
上 传 者：
sh-1993
说明： 用两种不同的算法求最小生成树。编程助理作为算法课程的一部分...
(Finding Minimum Spanning Tree Using Two Different Algorithms. Programming assingment as part of the Algorithms course of the Academic Collage Of Tel- Aviv.)
文件列表:
ALGO.sln (1432, 2022-05-12)
Code-files (0, 2022-05-12)
Code-files\ALGO.vcxproj (7774, 2022-05-12)
Code-files\ALGO.vcxproj.filters (2306, 2022-05-12)
Code-files\ALGO.vcxproj.user (390, 2022-05-12)
Code-files\DisjointSet.cpp (1649, 2022-05-12)
Code-files\DisjointSet.h (445, 2022-05-12)
Code-files\Edge.cpp (624, 2022-05-12)
Code-files\Edge.h (280, 2022-05-12)
Code-files\Graph.cpp (8185, 2022-05-12)
Code-files\Graph.h (1270, 2022-05-12)
Code-files\Neighbor.cpp (1164, 2022-05-12)
Code-files\Neighbor.h (507, 2022-05-12)
Code-files\Queue.cpp (1763, 2022-05-12)
Code-files\Queue.h (596, 2022-05-12)
Code-files\Utillities.cpp (6253, 2022-05-12)
Code-files\Utillities.h (987, 2022-05-12)
Code-files\heap.cpp (4635, 2022-05-12)
Code-files\heap.h (1251, 2022-05-12)
Code-files\main.cpp (486, 2022-05-12)
Debug (0, 2022-05-12)
Debug\ALGO.exe (257024, 2022-05-12)
Debug\ALGO.ilk (1112884, 2022-05-12)
Debug\ALGO.pdb (1011712, 2022-05-12)
# Find-MST
In this project you will find both Prim and Kruskal algorithms to find the MST in an Unadjusted graph of n vertices and m edges.
First Kruskal Algorithm will run, then Prim's and after both finished there is an option to remove an edge from the Graph and calculate the MST again with Kruskal.
the project recive input file name in argv[1], and output filename with argv[2]
input filename contains:
n
m
edges + Weight
edge to remove
for example:
5
6
1 2 5
2 3 2
4 1 3
1 3 6
1 5 2
2 4 1
2 3 // to remove
近期下载者：
相关文件：
收藏者：