Math, asked by devdivyanshu19, 8 days ago

DFS (Depth First Search) can be used to find the presence of

(a) Hamiltonian cycle in a graph

(b) Eulerian circuit in a graph

(c) Cycle in a connected graph

(d) MST

Answers

Answered by Anonymous

0

Answer:

c is the correct option

we can use DFS but not BFS for finding cycle in a connected graph

Previous Question

Next Question

Similar questions

Science, 4 days ago

global warming drawing...

Math, 4 days ago

(ii) 46 x 982 + 27 x 982 - 58 x 982 - 15 x 982...

Chemistry, 4 days ago

Explain why metallic oxies are basic in nature...

Geography, 8 days ago

state two uses of farming...

English, 8 days ago

Q: Who wanted to see the sea routes clear?

Geography, 7 months ago

Give a single word for each of the following: 1 . " The loose rock material , together with humus , forming the upper layer of the earth's crust and serving as a source of food and moisture for plants" 2 . " The process of percolation by which valuable mineral nutrients are washed down from the top layer of the soil only to deposit them in the lower layers , making thereby the top soil in fertile...

Math, 7 months ago

Find the HCF of given Monomials....

Physics, 7 months ago

Temperature is measured in Degree________...