logoSEE ALGORITHMS
    Bubble Sort
    Insertion Sort
    Selection Sort
    Radix Sort
    Heap Sort
    Merge Sort
    Quick Sort
Graph
    Depth First Search
    Breadth First Search
    Prim's Algorithm
    Kruskal's Algorithm
    Dijkstra's Algorithm
    Topological Sorting
    Hamiltonian Cycle
    Binary Search Tree
    Binary Heap
    Circular Queue
    Convex Hull
    Huffman Coding
Breadth First Search

Breadth First Search (BFS) explores a graph level by level, starting at a node and visiting all its neighbors before moving on to the next level. It uses a queue to manage nodes. BFS is ideal for finding the shortest path in an unweighted graph and for checking connectivity.

Draw Graph