The Applications of Graph Algorithms to Modeling of Integrated Urban Water Management System

The application of methods using graphs to model a variety of engineering issues has been known for several de-cades, but the application of graph algorithms to model the urban water management issues is a completely new approach. The article reviews the scientific literature on integrated urban water management systems in terms of the use of graph theory algorithms in this topic. Such a review has not been done before and constitutes a completely novel study. Some of the algorithms presented are directly derived from graph theory, while others were developed from other sciences, including environmental engineering or genetics, to solve specific engineering problems. The paper presents a general scheme and a brief description of the most important components of an integrated urban water management system. The necessary concepts of graphs were defined, the origin and the principle of graph algorithms used in modeling water management issues (Loop-By-Loop Cutting Algorithm, Hanging Gardens Algorithm, Tree Growth Algorithm, Dijkstra’s Algorithm, Genetic Algorithm, and Bayesian Networks Algorithm) were described. Their use in modeling the issues in stormwater, sanitary sewage and water distribution system was described. A complete list of scientific literature in this field was provided.