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!

Before we introduce the improvement of Prim algorithm, we shall first talk about a complete binary tree structure with restrictions. This kind of structure has very good order related quality, make it very useful in max-min problems. Let's see how little Ho use it to seek candy !