Ask
Login
0
8.8kviews
Explain various graph traversal techniques.
written 7.9 years ago by gravatar for teamques10 teamques10 ★ 65k modified 23 months ago by gravatar for sagarkolekar sagarkolekar ★ 11k
data structures and algorithms
ADD COMMENT EDIT
1 Answer
1
254views
written 7.9 years ago by gravatar for teamques10 teamques10 ★ 65k
  • Breadth-First Search (BFS) is a graph search algorithm that begins at the root node and explores all the neighboring nodes. Then for each of those nearest nodes, it explores their unexplored neighbor nodes, and so on, until it finds the goal.
  • BFS exhaustively searches the entire graph or sequence without …

Create a free account to keep reading this post.

and 4 others joined a min ago.

ADD COMMENT EDIT
Please log in to add an answer.