Breadth-first search is an algorithm for traversing or searching tree or graph data structures. It starts at the tree root, and explores all of the neighbor nodes at the present depth prior to moving on to the nodes at the next depth level.

bfs +4 more

by Sucheta Kulkarni

Stash 0

1 Attachment 4 years ago

Depth-first search (DFS) is an algorithm for traversing or searching tree or graph data structures. The algorithm starts at the root node (selecting some arbitrary node as the root node in the case of a graph) and explores as far as possible along each branch before backtracking.

bfs +4 more

by Sucheta Kulkarni

Stash 0

1 Attachment 4 years ago

BFS,spanning tree,DFS,and Dijkstra

bfs +3 more

by Mohd Salim

Stash 0

1 Attachment 3 years ago