Disconnected subgraph finding features
Also support providing an external edge filtering function to the algorithm that can either allow or prevent traversal of a district network edge.
-
Implement basic algorithm with edge filter -
Implement Apros-specific edge filter that checks if the edge is mapped to a dh_pipe UC and if that dh_pipe has its valve closed or not. If the valve is closed, the edge traversal shall be denied. -
A view for showing the disconnected subgraphs of the currently active network diagram. The view shall show the subgraphs from smallest to largest. The view shall be manually refreshed to prevent too expensive listening or continuous periodic computation. -
Selecting a subgraph from the view shall select the nodes and edges belonging to that subgraph from the network diagram editor and possibly also focus the selected material.
Edited by Tuukka Lehtonen