Awesome q2a theme
0 votes
14 views

Give an algorithm that determines whether or not a given undirected graph G=(V,E) contains a cycle. Your algorithm should run in $O(V)$ time, independent of E.

Solution:

If there’s a back edge, there’s a cycle. If there’s no back edge, there are only tree edges.  Hence, the graph is acyclic.
Thus, we can run DFS: if we find a back edge, there’s a cycle.

My doubt is how to manage this in $O(V)$ time ?

in Algorithms by (155 points) | 14 views
0
Already have that. You just give a little explanation about the complexity either from the link you provided or self explanation. Getting little difficulty to get that. Thank you.
+2
In simple terms, undirected connected graph which doesn't have cycles, should be a tree.

For Tree, edges=nodes-1

So, your dfs = O(nodes+edges) =O(2nodes-1)= O(nodes)
0

If we ever see $|V |$ distinct edges, we must have seen a back edge because in an acyclic (undirected) forest, $|E| ≤ |V | − 1$.

@Shaik Masthan

Got it sir, Thankyou

Please log in or register to answer this question.

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Top Users Dec 2019
  1. Pratyush Priyam Kuan

    164 Points

  2. Vimal Patel

    120 Points

  3. avistein

    65 Points

  4. srestha

    54 Points

  5. Mk Utkarsh

    49 Points

  6. arya_stark

    46 Points

  7. goxul

    39 Points

  8. Sathuri Bharath

    34 Points

  9. vishal burnwal

    32 Points

  10. Shaik Masthan

    28 Points

Monthly Top User and those within 60% of his/her points will get a share of monthly revenue of GO subject to a minimum payout of Rs. 500. Current monthly budget for Top Users is Rs. 75.
2,317 questions
1,295 answers
6,601 comments
89,719 users