69: Pillow Talk
Revision as of 18:08, 7 August 2012 by Waldir (talk | contribs) (Waldir moved page Pillow Talk to 69: Pillow Talk: Mass-moving pages to 'number: title' format, per discussion at explain xkcd:Community portal/Coordination#Page names)
Image Text
Maybe I should've tried Wexler?
Description
The joke is pretty self-explanatory, so I'll just fill in the backgrounds of Cueball's thoughts: The Bellman-Ford algorithm is an algorithm that calculates the shortest path(s) through a weighted digraph or collection of connected nodes or vertices. The “Wexler” in the image text refers to Wexler's algorithm, which is used to deal with the inverse problem of Electrical Impedance Tomography, or simply stated: the electrical conductivity of an (imhomogeneus) object.
And yes, both make terrible pillow talk, according to my significant other.
