Company: bny_30july
Difficulty: medium
Merge Networks Problem Description Developers are working on a new mapping library to help road planning. They are working on a new approach to minimize distances between places. Currently, there are two networks of places, networkA and networkB. networkA has networkA_nodes nodes and networkA_edges edges. networkB has networkB_nodes nodes and networkB_edges edges. networkA_from[i] and networkA_to[i] is an undirected edge from networkA_from[i] to networkA_to[i] in networkA. networkB_from[i] and networkB_to[i] is an undirected edge from networkB_from[i] to networkB_to[i] in networkB. Their goal is to add one edge that connects a node in each network to minimize the maximum distance between any two nodes. Determine that distance. Given that one new road (or undirected edge) connecting one of the places in networkA and another in networkB is to be added in such a way that maximum distance between any two different places in the new network is minimized. Find the minimum possible required d