Graph Traversal Technique

19views

written 7.2 years ago by

kaivanshah • 280

modified 7.2 years ago by

sanketshingote • 100

Graphs can be traverse in two ways

a. BFS (Breadth First Search)

b. DFS(Depth First Search)
BFS

1.Breadth-first search starts at a given vertex “S”, which is at level 0.

2.In the first stage, we visit all the vertices that are at the distance of one edge away.

3.When we …

Create a free account to keep reading this post.

and 3 others joined a min ago.

ADD COMMENT EDIT