Exercises

0 / 10

A graph that does not have a path of length 3 or more that connects a node v to itself is:

0 / 10

The sequence of vertices v1...vn with edges connecting all the vertices is called: