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!

This week, we'll still talk about the problem of Minimum Spanning Tree! But same as SPFA, this algorithm is do some improvements about the sparse graphs, so just don't submit last week's code again~