Eulerian path

English

Noun

Eulerian path (plural Eulerian paths)

  1. (graph theory) A walk that uses every edge of a graph exactly once.
This article is issued from Wiktionary. The text is available under Creative Commons Attribution-Share Alike 4.0 unless otherwise noted. Additional terms may apply for the media files.