オイラー路
1. Eulerian pathIn graph theory, an Eulerian trail (or Eulerian path) is a trail in a graph which visits every edge exactly once. Similarly, an Eulerian circuit or Eulerian cycle is an Eulerian trail which 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. Mathematically the problem can be stated like this: Given the graph on the right, is it possible to construct a path (or a cycle, i.e.
Read “Eulerian path” on English Wikipedia
Read “オイラー路” on Japanese Wikipedia
Read “Eulerian path” on DBpedia
Read “Eulerian path” on English Wikipedia
Read “オイラー路” on Japanese Wikipedia
Read “Eulerian path” on DBpedia
Discussions
Log in to talk about this word.