A big international retailer is setting up shop in india and plans to open stores in n towns (3 ≤ n ≤ 1000), denoted by 1, 2, . . . , n. there are direct routes connecting m pairs among these towns. the company decides to build warehouses to ensure that for any town x, there will be a warehouse located either in x or in an immediately neighboring town of x.write a program to find the minimum number of warehouses the company has to build
Answers
Answered by
0
bggggggggghhhgcfhjgffkkkjhhjhhbbgggggghmmmmmmmmnnbcxcbnjk
Similar questions