Geeksforgeeks

Error

×

Leaderboard

Showing:

Handle | Score |
---|---|

@Ibrahim Nash | 6564 |

@blackshadows | 6400 |

@mb1973 | 5785 |

@Quandray | 5275 |

@akhayrutdinov | 5111 |

@saiujwal13083 | 5074 |

@kirtidee18 | 4639 |

@sanjay05 | 3762 |

@mantu_singh | 3712 |

@gfgaccount | 3627 |

@marius_valentin_dragoi | 3525 |

Complete Leaderboard | |

Handle | Score |

@yaswanthero123 | 625 |

@vikash619 | 611 |

@venkat11803610 | 501 |

@roshan13ar | 396 |

@DevangSingh | 379 |

@ravi11815721 | 312 |

@hrishipangavhane | 286 |

@aryanjain85297 | 280 |

@kommaraju11806903 | 277 |

@infosumitraut | 272 |

@ankitsharma5422 | 256 |

Complete Leaderboard |

Given an adjacency matrix representation of an unweighted undirected graph named **graph**, which has **N** vertices. You have to find out if there is an eulerian path present in the graph or not.

**Note:** The graph consists of a single component

**Example 1:**

**Input:** N = 5
graph = {{0, 1, 0, 0, 1},
{1, 0, 1, 1, 0},
{0, 1, 0, 1, 0},
{0, 1, 1, 0, 0},
{1, 0, 0, 0, 0}}
**Output:** 1
**Explaination:** There is an eulerian path.
The path is 5->1->2->4->3->2.

**Example 2:**

**Input:** N = 5
graph = {{0, 1, 0, 1, 1},
{1, 0, 1, 0, 1},
{0, 1, 0, 1, 1},
{1, 1, 1, 0, 0},
{1, 0, 1, 0, 0}}
**Output:** 0
**Explaination:** There is no eulerian path in
the graph.

**Your Task:**

You do not need to read input or print anything. Your task is to complete the function **eulerPath()** which takes N and graph as input parameters and returns 1 if there is an eulerian path. Otherwise returns 0.

**Expected Time Complexity:** O(N^{2})

**Expected Auxiliary Space:** O(N^{2})

**Constraints:**

1 ≤ N ≤ 50

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

YesLoading...

Eulerian Path in an Undirected Graph

...