CareerCup

hi need solution
Statement:
Given a connected supply chain network with ‘n’ end items. Can this network be divided into two halves of approximately ‘n/2’ end items each so that the “connectedness count’ is minimized.

‘Connectedness count’ can be defined as follows.
Find the shared nodes. (Material/Capacity) between these two subnets. If these shared nodes (Across the two subnets) are reachable by the the end item in the subnet, then increment the connectedness count, for each reachability. If the connectedness from SubNet1 to these shared nodes is ‘n1’ and from SubNet2 is ‘n2’. Then the net connectedness count is => min(n1,n2)

A solution that yields “connected count of 0” would essentially mean that we found two large independent networks. This may not be possible always. Therefore minimizing the connectedness count is the goal.

there is PCB robot move from point of beginning go to destination find the shortest distance/shortest path from starting to destination