Prims and kruskal algorithm

g = Graph(9)
g.add_Edge(0, 1, 2)
g.add_Edge(0, 2, 4)
g.add_Edge(0, 6, 7)
g.add_Edge(2, 3, 5)
g.add_Edge(2, 1, 4)
g.add_Edge(1, 5, 4)
g.add_Edge(5, 7, 5)
g.add_Edge(7, 8 ,1)
g.add_Edge(6, 5 ,8)
g.add_Edge(6, 7 ,9)
g.add_Edge(3, 4 ,2)
g.add_Edge(1, 4 ,6)
g.add_Edge(5, 4 ,3)
g.add_Edge(7, 4 ,6)
g.add_Edge(8, 4 ,3)
g.prim_algo()

Similar codes

0 vote206 views2 answers
How to determine the level of each node in the given tree?
C
18 votes193 views6 answers
Sql delete query
C
0 vote183 views1 answer
Flip exis in dataframe
C
0 vote195 views1 answer
C unused variable
C
0 vote203 views2 answers
192.168.0.102
C
-1 vote333 views2 answers
C program
C
0 vote199 views1 answer
Esp32 dhcp server
C
0 vote190 views1 answer
Yum install supervisor amazon linux
C
0 vote153 views1 answer
How much larger integer i can input in c language?
C
2 votes231 views1 answer
Pygame draw transparent rectangle
C