BFS, stands for Breadth First Search. BFS stands for Breadth First Search is a vertex based technique for finding a shortest path in graph. What is BFS? BFS is an algorithm that is used to graph data or searching tree or traversing structures. Two of the most popular tree traversal algorithms are breadth-first search (BFS) and depth-first search (DFS).