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:
意义是,在数学的画图题中(其实是那种走各条相连线路的图)eulerian是指每一条线路都只走一次.这是1736年Leonhard Euler while由在解决"七座桥"问题时发明的
"七座桥"问题http://www.zww.cn/baike/html/3/368.shtml
参考资料：http://en.wikipedia.org/wiki/Eulerian_path