Math, asked by devdivyanshu19, 2 months 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

Hindi, 1 month ago

निम्नलिखित वाक्यों से पदबंध छाँटिए और उनका भेद लिखिए 1. सस्ता खरीदा हुआ कपड़ा नहीं चलता। 2. सड़क पर गिरी हुई वस्तु को मत छुओ। 3. वह बात-बात पर रोने लगता है। 4. घर के पीछे लगे पेड़ सूख गए। 5. गिरे हुए को उठाना एक महान कार्य है। 6. झूठ बोलने वाले व्यक्ति सच भी बोलें तो विश्वास नहीं होता। 7. दूध का जला आदमी ठंडे पानी से भी डरता है। 8. विद्यार्थी परीक्षा के लिए दौड़े चले आ रहे हैं।...

Math, 1 month ago

tq u so much adi.. define math??

Math, 1 month ago

43796 ÷41 What is the answer plz explain me option A is Q 1068 R = 8 B Q 1068 R = 7 C Q 1068 R = 6...

Geography, 2 months ago

state two uses of farming...

English, 2 months ago

Q: Who wanted to see the sea routes clear?

Geography, 10 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, 10 months ago

Find the HCF of given Monomials....

Physics, 10 months ago

Temperature is measured in Degree________...