← Quiz: Graph Theory Workshop: all 14 questions
Quiz: Graph Theory Workshop · Question 4 of 14
What is the time complexity of Hierholzer's algorithm?
What is the time complexity of Hierholzer's algorithm?
- A.O(V!)
- B.O(2^E)
- C.O(E), linear in the number of edges
- D.O(V³)
Answer & explanation
Correct answer: O(E), linear in the number of edges
Each edge is pushed and popped a constant number of times.
Can you get the rest right without peeking?
Take the timed Quiz: Graph Theory Workshop quiz free. Pass it to earn XP and count towards your certificate.
Start the quiz →