Texonom
Texonom
/
Application
Application
/Network Science/Graph Theory/
Eulerian path
Search

Eulerian path

Creator
Creator
Seonglae Cho
Created
Created
2023 Dec 19 1:26
Editor
Editor
Seonglae Cho
Edited
Edited
2023 Dec 19 1:26
Refs
Refs

Eulerian trail, 한붓그리기

 
 
 
 
 
Eulerian path
In graph theory, an Eulerian trail is a trail in a finite graph that visits every edge exactly once. Similarly, an Eulerian circuit or Eulerian cycle is an Eulerian trail that starts and ends on the same vertex. They were first discussed by Leonhard Euler while solving the famous Seven Bridges of Königsberg problem in 1736. The problem can be stated mathematically like this:Given the graph in the image, is it possible to construct a path that visits each edge exactly once?
Eulerian path
https://en.wikipedia.org/wiki/Eulerian_path
Eulerian path
 
 

Recommendations

Texonom
Texonom
/
Application
Application
/Network Science/Graph Theory/
Eulerian path
Copyright Seonglae Cho