What is a DFS useful for in a graph?

a. To find cycles in a graph
b. To find the minimum edge weight in a graph
c. To find the maximal edge by weight in a graph
d. To find the longest path between two vertices


a. To find cycles in a graph
The depth-first algorithm finds a cycle or a "loop" in a graph.

Computer Science & Information Technology

You might also like to view...

A is a window used to communicate with users.

a) project b) control c) dialog d) None of the above.

Computer Science & Information Technology

Answer the following statements true (T) or false (F)

1. In C++, a virtual destructor is invoked whenever a virtual constructor was used to create the object. 2. Redefining and overriding are exactly the same thing. 3. A class template can be derived from a non-template class. 4. A class template cannot be derived from a class template. 5. A non-template class can be derived from a class template instantiation.

Computer Science & Information Technology

The Layer Via Cut command differs from the Layer Via Copy command in that it _____ the selection from the background.

a. adds b. clips c. removes d. lifts

Computer Science & Information Technology

The possession of information is the quality or state of having value for some purpose or end.

Answer the following statement true (T) or false (F)

Computer Science & Information Technology