Editing 230: Hamiltonian
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 8: | Line 8: | ||
==Explanation== | ==Explanation== | ||
− | [[Cueball]], presumably in class, decides that the subject of | + | [[Cueball]], presumably in class, decides that the subject of Hamiltonian circuits in graphs is not important in the larger context of life and love. Later, however, he realizes there is a flaw in the proof presented, while in bed with [[Megan]], and suddenly wants to focus on the mathematics, in a humorous reversal of his position about what is meaningful. |
− | In graph theory, a {{w|Hamiltonian_path|Hamiltonian | + | In graph theory, a {{w|Hamiltonian_path|Hamiltonian}} is a traceable path that connects all the vertices (nodes) by passing through each one exactly once (Think connect the dots with rules!). If this is not possible, then it can be said that no Hamiltonian exists for the given set of vertices. A Hamiltonian cycle is a Hamiltonian where the path begins and ends at the same node. The professor is using the graph theory to optimize some algorithm by solving a {{w|Hamiltonian_path_problem|Hamiltonian path problem}}. He meant to say "Hamiltonian Cycle", but instead said only "Hamiltonian". |
− | The title text | + | The title text explains that the Hamiltonian Cycle can be solved in two different directions around the cycle. |
==Transcript== | ==Transcript== | ||
:Lecturer: And therefore, based on the existence of a Hamiltonian path, we can prove that the routing algorithm gives the optimal result in all cases. | :Lecturer: And therefore, based on the existence of a Hamiltonian path, we can prove that the routing algorithm gives the optimal result in all cases. | ||
:Cueball: Oh my God. | :Cueball: Oh my God. | ||
− | |||
:[Close-up of Cueball.] | :[Close-up of Cueball.] | ||
− | : | + | :(Out of frame): What? What is it? |
:Cueball: A sudden rush of perspective. What am I doing here? Life is so much bigger than this! | :Cueball: A sudden rush of perspective. What am I doing here? Life is so much bigger than this! | ||
:[Cueball running out of room.] | :[Cueball running out of room.] | ||
:Cueball: I have to go. | :Cueball: I have to go. | ||
− | |||
:[Cueball enters darkened room, where Megan waits by window.] | :[Cueball enters darkened room, where Megan waits by window.] | ||
:[Cueball and Megan embrace...] | :[Cueball and Megan embrace...] | ||
:[...and get into bed.] | :[...and get into bed.] | ||
− | |||
:[A heart appears over the supine bodies.] | :[A heart appears over the supine bodies.] | ||
:Megan: Ohh... | :Megan: Ohh... | ||
− | :''grip'' | + | :[Hands ''grip''.] |
− | |||
:Cueball (out of frame): Wait a moment. | :Cueball (out of frame): Wait a moment. | ||
:Megan (out of frame): What is it? | :Megan (out of frame): What is it? | ||
− | |||
:[Silence.] | :[Silence.] | ||
− | |||
:Cueball (out of frame): His proof only holds if there's a Hamiltonian <u>cycle</u> as well as a path! | :Cueball (out of frame): His proof only holds if there's a Hamiltonian <u>cycle</u> as well as a path! | ||
:Megan (out of frame): ...excuse me? | :Megan (out of frame): ...excuse me? | ||
− | :Cueball (out of frame): Paper, I need some paper. Hey, do you mind if I jot down some notes on your chest? | + | :Cueball (out of frame): Paper, I need some paper. |
+ | :Cueball (out of frame): Hey, do you mind if I jot down some notes on your chest? | ||
{{comic discussion}} | {{comic discussion}} |