Stream ordering and analysis of tree networks are necessary for understanding graph data structures. The idea of stream ordering finds its base in hydrology and open networks. Large dataset representations of such networks are difficult to process for analysis. In this paper, the stream ordering concept has been extended to a general class of structures characterized by open network semantics. A new algorithm has been proposed for analyzing tree networks and hierarchal subdivision of network segments through traversal, with minimal and generic computation over Arc-Node topological data sets. The algorithm has been implemented as a case study for understanding the complexity and calculation of manhole invert levels of sewer network of wastewater utility in the capital city of Delhi.
展开▼
