Skip to main content

Euler Path / Circuit

Learn Euler Path / Circuit (Graphs, Advanced DSA) with worked examples, diagrams and interview questions. Free on JavaSchoolLab.

Euler Path and Euler Circuit An Euler path uses every edge exactly once ; an Euler circuit does the same and ends where it started. Euler solved the Königsberg bridges puzzle by looking only at degrees (the number of edges at each vertex). In a connected undirected graph: all degrees even gives a circuit, exactly two odd degrees gives a path (it must start at one odd vertex and end at the other), and anything else has neither.

More lessons in Graphs