Eulerian path
id:
eulerian-path-164-6506894
title:
Eulerian path
text:
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? Euler proved that
brand slug:
wiki
category slug:
encyclopedia
description:
Trail in a graph that visits each edge once
original url:
https://en.wikipedia.org/wiki/Eulerian_path
date created:
2003-10-02T11:20:57Z
date modified:
2024-08-28T23:46:36Z
main entity:
{"identifier":"Q624580","url":"https://www.wikidata.org/entity/Q624580"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/f/fb/Comparison_7_bridges_of_Konigsberg_5_room_puzzle_graphs.svg","width":512,"height":768}
fields total:
13
integrity:
16