Editing 69: Pillow Talk
Warning: You are not logged in. Your IP address will be publicly visible if you make any edits. If you log in or create an account, your edits will be attributed to your username, along with other benefits.
The edit can be undone.
Please check the comparison below to verify that this is what you want to do, and then save the changes below to finish undoing the edit.
Latest revision | Your text | ||
Line 9: | Line 9: | ||
==Explanation== | ==Explanation== | ||
− | The {{w| | + | The {{w|Bellman_Ford|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 title text refers to Wexler's algorithm, which is used to deal with the inverse problem of {{w|electrical impedance tomography}}, or simply stated: the electrical conductivity of an (imhomogeneus) object. |
− | Both of these would make terrible {{w|pillow talk}}. Pillow talk is the conversation made by lovers after they have | + | Both of these would make terrible {{w|pillow talk}}. Pillow talk is the conversation made by lovers after they have made love, and is usually relaxed and intimate instead of technical. |
==Transcript== | ==Transcript== | ||
Line 17: | Line 17: | ||
:Cueball: I should have made something up. | :Cueball: I should have made something up. | ||
:Cueball: The Bellman-Ford algorithm makes terrible pillow talk. | :Cueball: The Bellman-Ford algorithm makes terrible pillow talk. | ||
− | |||
− | |||
− | |||
− | |||
{{comic discussion}} | {{comic discussion}} | ||
[[Category:Comics featuring Cueball]] | [[Category:Comics featuring Cueball]] | ||
− | |||
− | |||
− | |||
− |