Scribd Logo
Upload

Welcome to Scribd!

  • Dijkstra's Algorithm

    Uploaded by

    Tati Kong
    7 views7 pages
    The document discusses the work of Edsger Dijkstra, a computer scientist who developed an algorithm for finding the shortest path between two points in a graph. It provides background on Dijkstra, noting he developed the algorithm in 1959 while sitting in a cafe. The document then explains some key concepts in graph theory used in Dijkstra's algorithm, such as nodes, edges, and how edges can be assigned values. It concludes by discussing potential applications and impacts of computing and connectivity.

    Original Description:

    Original Title

    Dijkstra's algorithm

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document discusses the work of Edsger Dijkstra, a computer scientist who developed an algorithm for finding the shortest path between two points in a graph. It provides background on Dijkstra, noting he developed the algorithm in 1959 while sitting in a cafe. The document then explains some key concepts in graph theory used in Dijkstra's algorithm, such as nodes, edges, and how edges can be assigned values. It concludes by discussing potential applications and impacts of computing and connectivity.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    7 views7 pages

    Dijkstra's Algorithm

    Uploaded by

    Tati Kong
    The document discusses the work of Edsger Dijkstra, a computer scientist who developed an algorithm for finding the shortest path between two points in a graph. It provides background on Dijkstra, noting he developed the algorithm in 1959 while sitting in a cafe. The document then explains some key concepts in graph theory used in Dijkstra's algorithm, such as nodes, edges, and how edges can be assigned values. It concludes by discussing potential applications and impacts of computing and connectivity.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 7

    A Note on Two Problems in

    Connexion with Graphs


    E. W. Dijkstra

    Tati Kong, April 6th, 2022


    E. W. Dijkstra
    Lived 1930-2002

    Ph.D. from University of Amsterdam (Netherlands)

    Taught at UT Austin (and other places)

    Turing Award (1972): “referred to as the computer science equivalent of the Nobel Prize
    .” (Britannica, Turing Award)
    The Work: Background

    Algorithm for: 1. Finding shortest path between two points 2. Finding spanning tree
    with minimum total length.

    1959

    “he devised in 20 minutes while sitting in a café with his fiancée, Maria Debets”
    (Britannica, Edsger Dijkstra)

    Used to find quickest paths today (maps, communication routes)


    The Work: What it says

    Node = a point

    Edge = a line that connects exactly 2 nodes

    Edges are assigned a value

    Nodes can store information


    Discussion

    Rethink the definition of computing

    Math language?

    Other applications of the algorithm (


    https://www.javatpoint.com/graph-theory-applications)

    What are the impacts of computing and connectivity?


    Summary and Relation to CS110
    What are the impacts of computing and connectivity?

    Nodes store information and therefore can represent many things.

    Dijkstra created an algorithm that finds the shortest path between two nodes.

    Still has a large computing complexity: O(V+Elog(V))


    Works Cited

    https://www.britannica.com/biography/Edsger-Dijkstra

    https://www.britannica.com/topic/Turing-Award

    You might also like