As we have seen, an Euler circuit starts at a vertex, includes each edge in the graph exactly once, and ends at the starting vertex. An Euler path includes each edge exactly once, but can end at a vertex other than the starting vertex. In the following problem there may be an Euler circuit, an Euler path, or neither. Draw a graph that models the connecting relationships in the floorplan below. The vertices represent the rooms and the edges represent doorways connecting the rooms. Vertex D represents the outdoors. D A B C Is it possible to find a path through the house that uses each doorway once? If so, enter the sequence of rooms (vertices) visited, for example ABCDA. If it is not possible, enter DNE. ACBD X Question Help: @Video 1 Video 2 ) Message instructor Submit