This preview shows page 1. Sign up to view the full content.
Unformatted text preview: d to exit any node I enter until I enter
one of the nodes I have already visited call such a node X. When this
happens, one of two things will happen:
a. There are edges out of X that I am yet to use. If that is the case,
then keep going. b. There are no more edges out of X that I am yet to use. Call the
circuit we obtained "C".
Under case b, we have one of two possibilities either:
All edges of the graph are in C, in which case we are done since we
proved the...
View
Full
Document
 Spring '13
 AzerBestavros

Click to edit the document details