cross-posted from: https://programming.dev/post/8619086
Title text:
It’s like the traveling salesman problem, but the endpoints are different and you can’t ask your friends for help because they’re sitting three seats down.
Links:
You must log in or register to comment.
Good thing I don’t know enough people for me to ever go to the movies in that big a group.
the problem here is technically not you knowing people but that the people you know can also know people that you don’t know, expanding the graph beyond the first layer that you personally observe.
tl;dr: don’t allow recursive invites
Optimal seating for this group would probable be this graph left to right, except for one-way crush person, they go on the very right.
First couple > bottom friend > top friend > second couple > top right friend > 1-way crusher
Friends are within 1 seat of each other.
My biggest pet peeve was working in a restaurant and trying to seat a large group. That hatred has been with me for decades, that I actively refuse to involve myself in dinners larger than 6 people. It’s noisy. It’s too much management. There’s multiple conversations. It’s awful.
Even during family outings in public areas, I assemble little groups and pretend like we don’t know each other.
And before anybody even asks, I absolutely segmented my wedding into different 6-person teams when we went out in public.
The group in this comic is bizarrely low connectivity for what is supposedly a friendship group. Not a single 3-cycle of actual friends among them?
Cringe
Thanks for your input
It is cringe because the XKCD guy does not know when to stop. The second part of the comic (the white on black part) makes it worse. The graph is the punchline. But then he keeps drawing, and ruins it.
