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