Computer scienceAlgorithms and data structuresAlgorithmsGraph algorithmsGraph search algorithms

Graph traversal

Dense or not

Report a typo

Which of the following statements is correct about the number of edges of a graph?

Select one option from the list

Dense graphs can be less time-consuming to traverse

Dense graphs can be more time-consuming to traverse

The density of a graph never affects the traversal complexity

Create a free account to access the full topic