You’ve got three busses: one takes you half way home, but you need to walk the rest of the way in the rain. The second takes you 75 miles in the wrong direction. The third never actually leaves the station. Which bus are you taking?

This isn't far off the puzzle of my commute, and it turned out the answer to that was bike.

At this point it's one bus will take you 75 miles in the wrong direction and the other bus will take you 75 miles in the wrong direction but the driver will drive more slowly and spend the entire time telling the passengers to stop complaining, the bus is too headed in the right direction and you're just too stupid to see it.

I'll shamelessly repeat myself from another thread because the libs don't appreciate my genius i want to. Context is "i was fucking tired of all the effin bus analogies in that thread so i made my own

Living thru this election is being strapped in a burning swerving greyhound bus and both drivers are fighting over the intercom about illegal trans-immigrant surgery instead of watching the road the intercom is broken but no one's listening anyway we're all screaming at the drivers cuz we're crushing bodies left and right and anyway our hairs on fucking fire and then we realize (holy shit neither of these assholes will stop the bus) and we start struggling but the belts are too tight or maybe they're the only thing keeping us from flying out the side and then while we're fighting and burning we look out the window and we see a guy on the sidewalk and he's holding a sign

BE

REASONABLE

(they didn't like my version)

You’ve got three busses: one takes you half way home

I wish the democrats were even that useful. The analogy is broken immediately.

They forgot that every bus is running over children as they go

If I was on an actual bus with the cheyney family I'd do something

Think of the election as a Bus route from source, S, to Target, T. a directed graph G=(V,E), where V is the set of vertices (nodes) and E is the set of edges. Each edge (i,j)∈E has an associated non-negative cost (or length) c_ij

Let x_ij​ be a binary variable that equals 1 if edge (i,j) is included in the shortest path, and 0 otherwise.

Minimize ∑​_(i,j)∈E [c_ij​x_ij​]

Subject to:

∑_j:(s,j)∈E[x_sj]−∑_i:(i,s)∈E [x_is]=1

∑_i:(i,t)∈E [x_it]−∑_j:(t,j)∈E [x_tj]=−1

∑_i:(i,k)∈E [x_ik]−∑_j:(k,j)∈E [x_kj]=0∀k∈V∖{s,t}

xij∈{0,1}∀(i,j)∈E

Rage for the Machine

erm actually in the scenario where the train doesn't leave the station, it's never specified that it starts raining. me personally, I would rather walk the full distance without rain than half the distance with rain