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 3: | Line 3: | ||
| date = February 27, 2006 | | date = February 27, 2006 | ||
| title = Pillow Talk | | title = Pillow Talk | ||
| − | | image = | + | | image = Pillow talk.jpg |
| + | | imagesize = | ||
| titletext = Maybe I should've tried Wexler? | | titletext = Maybe I should've tried Wexler? | ||
}} | }} | ||
==Explanation== | ==Explanation== | ||
| + | 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 image 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. | ||
| − | + | And yes, both make terrible pillow talk, according to my significant other. | |
| − | |||
| − | |||
==Transcript== | ==Transcript== | ||
| Line 18: | Line 18: | ||
:Cueball: The Bellman-Ford algorithm makes terrible pillow talk. | :Cueball: The Bellman-Ford algorithm makes terrible pillow talk. | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
[[Category:Comics featuring Cueball]] | [[Category:Comics featuring Cueball]] | ||
| − | |||
| − | |||
| − | |||
| − | |||
