Due to the high complexity (NP-complete) and, therefore, high computational runtime for finding such a tree, the following approximation with a time complexity of O(|E| log(|V|) + |V|2) is used for generating an MWG (|E| and |V| are the number of edges and vertices). Based on...