In the mathematical field of graph theory, an Eulerian path is a path in a graph which visits each edge exactly once. They were first discussed by Leonhard Euler while solving the famous Seven Bridges of Königsberg problem in 1736. Mathematically the problem can be stated like this:
意義是,在數學的圖論中,
"七座橋"問題http://www.zww.cn/baike/html/3/368.shtml
參考資料:http://en.wikipedia.org/wiki/Eulerian_path