METHOD OF SEARCHING SHORTEST PATH ON NETWORK AND COMPUTER READABLE RECORD MEDIUM ON WHICH PROGRAM FOR EXECUTING METHOD IS RECORDED

摘要

A method for searching the shortest route in the network and a computer-readable recording medium storing a program thereof are provided to enable a first user to make the human network efficiently by finding the shortest route from a first user to a second user quickly. It is checked whether a second user is included in a first search tree using human network information of a first user(S220). The shortest route between the first and second user is calculated when the second user is included in the first search tree. The second search tree is generated through the human network information of the second user when the second user is not included in the first search tree(S250). The shortest route between the first and second user passing through a third user is calculated by searching the third user found in a user set forming a node of the first search tree and the user set forming the node of the second search tree at the same time(S260). The human network information of the third user included in the first or second search tree is searched by using a depth or breadth first search mode based on the human network information of the first or second user.