Given a undirected graph, the task is to complete the method **isCyclic()** to detect if there is a cycle in the undirected graph or not.

**Input:**

The first line of the input contains an integer **'T'** denoting the number of test cases. Then **'T'** testcases follow. Each testcase consists of two lines. Description of testcases are as follows: The First line of each testcase contains two integers **'N' and 'M' **which denotes the no of vertices and no of edges respectively. The Second line of each test case contains **'M' ** space separated pairs **u** and **v** denoting that there is a bidirectional edge from **u** to **v** .

**Output:**

The method should return **1** if there is a cycle else it should return **0**.

**User task:**

Since this is a functional problem you don't have to worry about input, you just have to complete the function **isCyclic.**

**Constraints:**

1 <= T <= 100

1 <= N,M <= 100

0 <= u,v <= N-1

**Example:
Input:**

3

2 2

0 1 0 0

4 3

0 1 1 2 2 3

5 4

0 1 2 3 3 4 4 2

**Output:**

1

0

1

**Explanation:
Testcase 1:** In above first test case there is a graph with 2 vertices and 2 edges the first edge is from 0 to 1 and other edge is from 0 to 0 .

Author: Shubham Joshi 1

If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.

preparecodinginterview_dot_com | 190 |

hari32147 | 162 |

JonSnow_IKnowNothing | 160 |

AdityaRaj9 | 112 |

shivamsingh00236 | 111 |

abducodes | 906 |

harshtyagi36 | 447 |

arpit_anshuman | 335 |

vamsikrishna55 | 323 |

sandipbhaumik | 321 |

blackshadows | 5331 |

Ibrahim Nash | 5219 |

akhayrutdinov | 5111 |

mb1973 | 4929 |

Quandray | 4567 |

Login to report an issue on this page.