Title text: The problem with perspective is that it's bidirectional.
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 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 Hamiltonian path problem. He meant to say "Hamiltonian Cycle", but instead said only "Hamiltonian Path".
The title text explains that the Hamiltonian Cycle can be solved in two different directions around the cycle.
- 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.
- [Close-up of Cueball.]
- Offscreen: What? What is it?
- Cueball: A sudden rush of perspective. What am I doing here? Life is so much bigger than this!
- [Cueball running out of room.]
- Cueball: I have to go.
- [Cueball enters darkened room, where Megan waits by window.]
- [Cueball and Megan embrace...]
- [...and get into bed.]
- [A heart appears over the supine bodies.]
- Megan: Ohh...
- Cueball (out of frame): Wait a moment.
- Megan (out of frame): What is it?
- Cueball (out of frame): His proof only holds if there's a Hamiltonian cycle as well as a path!
- 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?
add a comment! ⋅ add a topic (use sparingly)! ⋅ refresh comments!