Answer: In graph theory, breadth-first search (BFS) is a strategy for searching
in a graph when search is limited to essentially two operations; (a) visit and
inspect a node of a graph; (b) gain access to visit the nodes that neighbor the
currently visited node.
Post a Comment