testkruskal.output

datastucutre and algorithms, application, in C

Enter number of edges in 7 vertex graph
Enter weighted edge 1
Enter weighted edge 2
Enter weighted edge 3
Enter weighted edge 4
Enter weighted edge 5
Enter weighted edge 6
Enter weighted edge 7
Enter weighted edge 8
Enter weighted edge 9
The adjacency matrix is
0  28  0  0  0  10  0  
28  0  16  0  0  0  14  
0  16  0  12  0  0  0  
0  0  12  0  22  0  18  
0  0  0  22  0  25  24  
10  0  0  0  25  0  0  
0  14  0  18  24  0  0  

The linked lists are
6 10   2 28   
3 16   7 14   1 28   
4 12   2 16   
5 22   3 12   7 18   
4 22   7 24   6 25   
5 25   1 10   
4 18   5 24   2 14   
Using cost-adjacency matrix
The min cost spanning tree edges are
(1, 6, 10)
(3, 4, 12)
(2, 7, 14)
(2, 3, 16)
(4, 5, 22)
(5, 6, 25)

Using linked-adjacency lists
The min cost spanning tree edges are
(1, 6, 10)
(3, 4, 12)
(2, 7, 14)
(2, 3, 16)
(4, 5, 22)
(5, 6, 25)