what is traversing explain with diagram
Answers
Answered by
2
A breadth-first search (BFS) is another technique fortraversing a finite graph. BFS visits the neighbor vertices before visiting the child vertices, and a queue is used in the search process. This algorithm is often used to find the shortest path from one vertex to another
subhaq:
not bro but sis
mane ??
i am a girl
bujhiparilini
ohhh.
sis
ok
bye
ur name subha ???
yah...bye sis
Similar questions