Talk:Euler tour technique
Latest comment: 13 years ago by AxelBoldt in topic [Untitled]
 | This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
[Untitled]
editThe instruction
- We make the edge list reflexive:
- For each edge (u,v) ∈ {E(T)}, insert (u,v) in the edge list.
does not make sense. I presume that the list of undirected edges is being made symmetric, i.e.
- For each undirected edge {u,v} in the tree, insert (u,v) and (v,u) in the edge list.
The non-standard notations O(sort(n)) and O(Prefix sum(n)) should be explained.
Is it being assumed that the root of the tree is the first element in the vertex ordering and that therefore the succ list starts at the root? If so, this should be mentioned. The applications section seems to assume that succ starts at the root. AxelBoldt (talk) 16:40, 19 February 2011 (UTC)