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?

The shorest path is no doubt the simplest but most classic problem in graph theory, but what it contains - induction, is the sharpest weapon to solve graph problems ! Differ than Dijstra, the Floyd algorithm uses very simple idea, and only 5 lines of code to do all the calculation besides input and output. And also, it can calculate the shorest path between each pair of node at the same time! Let's see how Hi and Ho learn this!