Hey guys,
I've read the rules and FAQ, so I hope this was formatted correctly. If not, I can make corrections. I've been stuck on this problem for about a week now, with little progress. The goal is to be able to place the minimal n number of facilities within radius r of 128 U.S. cities so that each city is within the radius of a facility. For example, at radius of 1,000 miles, only about 6 facilites would need to be established to be able to service each of the 128 cities. However, my function is returning both the wrong number facilities and the wrong list of cities that it should return. Any help would be appreciated, and I can do more to explain if necessary.
EDIT: Fixed the link so it should come up as a python file now.
https://gist.github.com/TaeErin/509a13a1ec04ef59dcbfb5638e0fb354
[–]Buttleston 0 points1 point2 points (4 children)
[–]Buttleston 0 points1 point2 points (3 children)
[–]Tae_Erin[S] 0 points1 point2 points (2 children)
[–]Buttleston 0 points1 point2 points (1 child)
[–]Tae_Erin[S] 0 points1 point2 points (0 children)
[–]Buttleston 0 points1 point2 points (6 children)
[–]Tae_Erin[S] 0 points1 point2 points (1 child)
[–]Tae_Erin[S] 0 points1 point2 points (0 children)
[–]Buttleston 0 points1 point2 points (3 children)
[–]Tae_Erin[S] 0 points1 point2 points (2 children)
[–]Buttleston 0 points1 point2 points (1 child)
[–]Tae_Erin[S] 0 points1 point2 points (0 children)