MCQOPTIONS
Saved Bookmarks
| 1. |
The time complexity to find a Eulerian path in a graph of vertex V and edge E is _____________ |
| A. | O(V²) |
| B. | O(V+E-1) |
| C. | O(V+E) |
| D. | O(E+1) |
| Answer» D. O(E+1) | |