Explain dfs and bfs with help of example
Answers
Answered by
0
The breadth first search ( BFS) and the depth
first search (DFS ) are the two algorithms
used for traversing and searching a node in
a graph. They can also be used to find out
whether a node is reachable from a given
node or not.
first search (DFS ) are the two algorithms
used for traversing and searching a node in
a graph. They can also be used to find out
whether a node is reachable from a given
node or not.
Similar questions
English,
8 months ago
India Languages,
8 months ago
Physics,
1 year ago
Social Sciences,
1 year ago
Science,
1 year ago