A joke The boss wants to produce programs to solve the follow two problems Euler circuit problem given a graph G, find a way to go through each edge exactly once Hamilton circuit problem given a graph G, find a way to go through each vertex exactly once The two problems seem to be very similar Person a takes the first problem and person b takes the secon Outcome: Person a quickly completes the program, whereas person b works 24 hours per day and is fired after a few months 2021/26 CS4335 Design and Analysis of2021/1/26 CS4335 Design and Analysis of Algorithms /Shuai Cheng Li Page 16 A joke: The boss wants to produce programs to solve the following two problems Euler circuit problem: • given a graph G, find a way to go through each edge exactly once. Hamilton circuit problem: • given a graph G, find a way to go through each vertex exactly once. The two problems seem to be very similar. Person A takes the first problem and person B takes the second. Outcome: Person A quickly completes the program, whereas person B works 24 hours per day and is fired after a few months