Company: Jupiter money
Difficulty: medium
Graph Challenge Problem Description Have the function GraphChallenge(strArr) take strArr which will be a representation of an undirected graph in a form similar to an adjacency list. Each element in the input will contain an integer which will represent the population for that city, and then that will be followed by a comma separated list of its neighboring cities and their populations (these will be separated by a colon). For example, strArr may be ["1:[5]", "2:[5]", "3:[4,2]", "4:[5,15,7]", "7:[2,8]", "8:[7,38]", "15:[2]", "38:[0]"] . This graph then looks like the following picture: Each node represents the population of that city and each edge represents a road to that city. Your goal is to determine the maximum traffic that would occur via a single road if everyone decided to go to that city. For example: If every single person in all the cities decided to go to city 7, then via the upper road the number of people coming in would be (8 + 38) = 46. If all the cities beneath city 7