From charlesreid1

Revision as of 22:53, 27 April 2019 by Admin (talk | contribs) (→‎Related)

Euler tour/Euler path - a tour around a graph that visits every edge of the graph exactly once.

Euler circuit/Euler cycle - an Euler tour that starts and ends at the same vertex.

Overview

An Euler Circuit is an Euler path or Euler tour (a path through the graph that visits every edge of the graph exactly once) that starts and ends at the same vertex.

Related: Graphs/Euler Tour

Related

Graphs:

Traversals on trees:

Breadth-first search and traversal on trees:

  • BFS - breadth first search
  • BFT - breadth first traversal

Depth-first search and traversal on trees:

  • DFS - depth first search
  • DFT - depth first traversal

OOP design patterns:

Category:Traversal

Flags