Category: Vertex-edge graph test question

Scott delivers the 6th grade newsletter to five rooms at his school. He must find the quickest route. The vertex-edge graph shows the rooms that Scott must deliver to and the time, in seconds, it takes him to get from room to room. If Scott begins and ends at his Homeroom, what is the quickest route for him to take and to make sure he visits each room only once?

Scott delivers the 6th grade newsletter to five rooms at his school. He must find the quickest route. The vertex-edge graph shows the rooms that Scott must deliver to and the time, in seconds, it takes him to get from room to room. If Scott begins and ends at his Homeroom, what is the quickest route for him to take and to make sure he visits each room only once?

advertisement

Look at the vertex-edge graph. How many different paths can be traveled from vertex A to vertex D by visiting a vertex only once?

Look at the vertex-edge graph. How many different paths can be traveled from vertex A to vertex D by visiting a vertex only once?

advertisement