OurBigBook Wikipedia Bot Documentation
A Trémaux tree, named after the French mathematician Édouard Trémaux, is a structure used in graph theory, specifically in the context of exploring undirected graphs. It is used to represent the exploration of the graph and the paths taken during a traversal. Typically, a Trémaux tree is constructed during a depth-first search (DFS) or a breadth-first search (BFS) of a graph, where the edges represent the paths followed by the traversal.

Ancestors (6)

  1. Spanning tree
  2. Computational problems in graph theory
  3. Computational mathematics
  4. Fields of mathematics
  5. Mathematics
  6. Home