Minimal loop extraction for leak detection in water pipe network

In the present research a new algorithms of minimal loop extraction has been done for leak detection in water pipe network. In the present work water pipe network has been converted into graph data structure with pipes as edges and node of the network as node of the graph. Nested Breadth First Search (NBFS) algorithm has been developed for automatic extraction of loops from the graph. First Breadth First Search (BFS) gives the signature as back edges for loops, which, are finally extracted by applying another BFS with the help of vertices of the back edge. Water pipe network has been analyzed by using Hardy Cross equation. The pressure at nodes is calculated with help of the network input parameters and the balanced discharges in pipes obtained by the Hardy Cross technique. Unexpected pressure drop at node will give signature of the leak in the pipe near the node.