Consider the sketch of an office floor with common traffic doors and associated graph: C Room C B Room A Room B Outside Outside It is possible to take a walk through this office, starting in Room A, going through each door once (and only once) and ending O in Room B. O back in Room A. O in Room C. O outside. O It is not possible to go through each door once and only once