Peng-Yu Chen
Peng-Yu Chen
Hi @CurieLuo, thank you for issuing the problem. However, I'm busy recently. I'll try to correct this when I'm free.
I've added the `EULER-TOUR` pseudocode [here](https://walkccc.github.io/CLRS/Chap22/Problems/22-3/)
Yes, I agree with you. The problem asks us to eliminate recursion. To achieve the same time complexity, we have to use a variable to record who's the first WHITE...
Yea, please create a PR :)
For (b), I think you're right. Since $\Theta(\log_d n)$ is also correct, I'll leave it as it is for now. For (c), Updated the if-clause in the pseudocode. Thank you!
Hi @ustcjsj, Can you create a PR for this. Thanks!
Hey, try this: https://walkccc.github.io/CLRS/Chap22/22.1/#221-4
I've rewritten the answer and tried to make it more readable!
Maybe you can see my website: https://walkccc.github.io/CLRS/Chap17/17.3/
I know what you were talking about! I've corrected the solution with a matrix `M` of size |V|^2. Please check it!