Figure B1. Examples for the introduced concepts. (1) An example of a weighted graph with random weights assigned for exemplary purposes. In a real network, the weight of an edge could be the likelihood (or strength) of the connection or other values such as mutual information, etc. (2) An example of a spanning tree. (3) An example of a minimum spanning tree. (4) An example of a dense spanning tree. (5) An example of a minimum dense spanning tree introduced in this paper (see Methods Section Integrating data into the structural analysis: minimum dense spanning trees).