Complexity of Graph Traversal

Question

What is the computational complexity of breadth-first and depth-first traversal in terms of the number of vertices v and the number of edges e when the graph is represented as an adjacency matrix?

Codor · Accepted Answer · 2016-03-24 18:48:40Z

2

The complexity is O(v^2), as the adjacency matrix must be searched to obtain all neighbors of a single vertex.

answered Mar 24, 2016 at 18:48

Codor

17.6k9 gold badges32 silver badges59 bronze badges

Sign up to request clarification or add additional context in comments.

Collectives™ on Stack Overflow

Complexity of Graph Traversal

1 Answer 1

Comments

Your Answer

Linked

Hot Network Questions

Collectives™ on Stack Overflow

1 Answer 1

Comments

Your Answer

Sign up or log in

Post as a guest

Linked

Related