Dijkstra's algorithm In hindi ..Dijkstra's algorithm kya hota hai aur uske problem kaise solve kare

Поделиться
HTML-код
  • Опубликовано: 30 сен 2024
  • #dijkstra'salgorithm
    #Dijkstra'salgorithminhindi
    #dijkstra
    The Dijkstra algorithm is a graph search algorithm that solves the single-source shortest path problem for a graph with non-negative edge weights, producing a shortest path tree. This algorithm is often used in routing and as a subroutine in other graph algorithms. It was conceived by computer scientist Edsger W. Dijkstra in 1956 and published three years later. The algorithm exists in many variants; Dijkstra's original variant found the shortest path between two nodes, but a more common variant fixes a single node as the "source" node and finds shortest paths from the source to all other nodes in the graph, producing a shortest-path tree.
    #hindimedrijkstra'salgorithm
    #drikstrainhindi

Комментарии • 3