Hiho! is a serial contests we developed to help programmers improve their skills following some architecture. After a serial of explaination about complex tree struct operation, we now move our topic to new data struct - Graph!

After the stack we've discussed last week, we can easily modify our Prim algorithm, and after this modification, we will find out that the modified Prim algorithm and Kruscal algorithm has the same complexity!