Euler Circuit in a Directed Graph
Submissions: 575   Accuracy:

47.85%

  Difficulty: Medium   Marks: 4

Eulerian Path is a path in graph that visits every edge exactly once. Eulerian Circuit is an Eulerian Path which starts and ends on the same vertex. Your task is to find that their exists the Euler circuit or not.

Input:
First line consists of test cases T. First line of every test case consists of 2 integers V and E, denoting the number of vertex and edges. Second line of every test case consists of 2*E spaced integers denoting the direction of edge connected(from - to).

Output:
Return the bool value to print 1 if Euler circuit exists else 0.

Constraints:
1<=T<=100
1<=V,E<=100

Example:
Input:

1
5 6
1 0 0 2 2 1 0 3 3 4 4 0
Output:
1

** For More Input/Output Examples Use 'Expected Output' option **

Contributor: Saksham Raj Seth
Author: saksham seth


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.



Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.


to report an issue on this page.