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
Dijkstra's Algorithm

Dijkstra's Algorithm finds the shortest path from a source node to all other nodes in a graph with non-negative weights. It uses a priority queue to explore nodes in order of increasing distance. This algorithm is widely used in routing and navigation systems.

Draw Graph