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 classic problem "Shorest path" in graph data struct, this time we will talk about a very similar problem - Minimum Spanning Tree. And specially, the actual code of Prim algorithm and Dijstra algorithm is almost the same, so why don't you give a try on it!