I'm trying to find a minimum spanning tree for this graph below using Krusal's and Prim's algorithm. This is what I got for each algorithm:
Krusal: visited= {(ck),(kf),(ib),(bf),(da),(ig),(ae),(di),(ah),(kg),(al),(ej)}. Total Weight=81
Prim: visited={(ck),(kf),(bf),(ib),(ig),(di),(da),(ae),(ah),(al),(ej),(fl)}. Total Weight=89
I know that the total weight should be the same, but they are not the same. Could you guys help me out? Thanks!
