“…The partition of the network is typically achieved by using graph algorithms, e.g. breadth first search and depth first search (Deuerlein, 2008;Perelman and Ostfeld, 2011;Ferrari et al, 2013;DiNardo et al, 2013a), multilevel partitioning (DiNardo et al, 2013b), community structure (Diao et al, 2013), and spectral approach (Her-rera et al, 2010). The selection of pipes that need to be disconnected is found by iterative procedures (Ferrari et al, 2013;Diao et al, 2013) or genetic algorithms (DiNardo et al, 2013a,b).…”