An Optimum Search Algorithm of Simulating Hydrokinetics

The shortest path problem, one of classic topic in the field of Graph Theory and path search, majors in the method about how to find the shortest path between two nodes in a directed-graph. Based on observing the relationship between water flow rate and pipe diameter in a pipeline network, the paper puts forward a kind of multi-thread parallel path search algorithm deriving of Hydrokinetics, namely Water flow Search Algorithm, WFS. Besides, the author has designed a multi-thread program to conduct test. It has been proved that WFS is of great feasibility and applicability to deal with the shortest path problem.