Euler solved this problem in 1736. He changed this problem into the first graph theory problem by abstract analyzed method.
欧拉在1736年解决了这个问题，他用抽象分析法将这个问题化为第一个图论问题。
2
This leads us to another contribution of Leonhard Euler to graph theory, namely Euler's polyhedron theorem or simply Euler's formula.
这是我们引向l·尤拉对图论的另一个贡献，即尤拉多面体定理，或简称尤拉公式。
3
Graph algorithms form a very important part of computer science and have a lineage that goes back at least to Euler and the famous Seven Bridges of konigsberg problem.