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

1 vote349 views1 answer
Grepper vscodium
C
0 vote380 views1 answer
How to show function arguments in pycharm
C
0 vote336 views1 answer
Molotovn't ribbentropn't pact
C
3 votes387 views1 answer
Error: 'for' loop initial declarations are only allowed in C99 or C11 mode
C
2 votes352 views1 answer
Printf signed char
C
1 vote333 views1 answer
Docker: Error response from daemon: could not select device driver "" with capabilities: [[gpu]].
C
-1 vote352 views1 answer
Smallest c program ever
C
0 vote334 views1 answer
Balanced binary tree
C
1 vote393 views1 answer
Differnce between spooling and buffering
C
0 vote358 views1 answer
Gdebi install with yes option
C