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, why not change some taste?

For algorithm like Dijstra and Floyd, we do not care about the number of edge after the input. But some algorithm depends on it - like SPFA, it will imply very efficient calculation of the shortest path program on sparse graphs(Have less edges).