×

# Euler path

 0 Hi, i am trying to solve http://www.spoj.com/problems/WORDS1/ on spoj,i came to know the problem is about checking the graph has euler path or not. Any one please tell me how to check if a graph has euler path? asked 18 Jul '15, 09:18 4★pallesai 176●8●30 accept rate: 17%

 1 Check the following conditions for Euler path to exist: Graph should be connected There should be exactly one vertex with outdegree-indegree=1 (starting vertex) There should be exactly one vertex with indegree-outdegree=1 (final vertex) To actually determine the euler path refer to this excellent tutorial. Here is another excellent problem on Euler path to try. answered 18 Jul '15, 10:07 333●2●3●9 accept rate: 20%
 toggle preview community wiki:
Preview

By Email:

Markdown Basics

• *italic* or _italic_
• **bold** or __bold__
• image?![alt text](/path/img.jpg "title")
• numbered list: 1. Foo 2. Bar
• to add a line break simply add two spaces to where you would like the new line to be.
• basic HTML tags are also supported
• mathemetical formulas in Latex between \$ symbol

Question tags:

×29
×23

question asked: 18 Jul '15, 09:18

question was seen: 1,682 times

last updated: 18 Jul '15, 10:07