Hierholzer’s Euler Tour Algorithm

Initialization

arbitrary find a tour

Repeat

Search Phase

find a node on the trail which has an

untraversed outgoing edge.

Construct Phase

start from the node to construct a

new tour, and patch the new tour

onto the original tour.

Until all edges are traversed.

前一張投影片

下一張投影片

回到第一張投影片

檢視圖形版本