Group Project

Chris and his seven friends need to meet up for a group project discussion. Each circle above represents one of their member's house. To minimize the total effort, they decided to meet up in one of the member's house such that the total distance everyone needs to travel is minimized. Where should they meet for their discussion?

1 2 5 3 8 6 4 7

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

2 solutions

Jesse Nieminen
Aug 29, 2016

By brute-forcing through every possible meet up location, we find that 5 \boxed{5} takes the least amount of travel.

How would you algorithmically approach the problem if the graph was larger?

Agnishom Chattopadhyay - 4 years, 9 months ago
Gary Jiang
Aug 30, 2016

5 position takes one times to travel for most friends

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...