contestada

HELP!!!
The image shown here is a floor-plan of a house.

Make a vertex-edge graph of this floor-plan, where each letter is a vertex and each doorway is an edge.

It is possible to take a tour of the house so that you walk through each doorway only once and finish at your starting point.


True
False

HELP The image shown here is a floorplan of a house Make a vertexedge graph of this floorplan where each letter is a vertex and each doorway is an edge It is po class=

Respuesta :

tnfrance
True! You can start at A and go to B, D, E, F, and then go out the side door of C.

Otras preguntas