dijkstra in A Sentence

    1

    Richard Dijkstra November 3, 2011.

    0
    2

    Richard Dijkstra July 3, 2014.

    0
    3

    Richard Franke Dijkstra.

    0
    4

    Yes, Dijkstra's does work, with a couple of modifications:.

    0
    5

    Graph algorithms like Dijkstra's algorithm will not work because the graph is enormous.

    0
    6

    But an additional pain point of Dijkstra etc is that such searches uses lots of RAM.

    0
    7

    Also there are some more ideas to make Dijkstra faster like doing A*, which is a"goal-oriented Dijkstra".

    0
    8

    The simplest solution is a Dijkstra and a simple improvement is a bidirectional Dijkstra which explores roughly only the half of the nodes.

    0
    9

    With bidirctional Dijkstra a route through entire Germany takes already 1sec(for car mode), in C it would be probably only 0.5s or so;

    0
    10

    Instead of doing Dijkstra's once from source to dest, you start at each end, and expand both sides until they meet in the middle.

    0
    11

    This argument doesn't necessarily hold because Dijkstra will not usually look at the complete graph but rather just a very small subset(the better interconnected the graph, the smaller this subset).

    0
    12

    Contributing factors to its popularity and widespread acceptance, at first in academia and later among practitioners, include the discovery of what is now known as the structured program theorem in 1966,[2] and the publication of the influential"Go To Statement Considered Harmful" open letter in 1968 by Dutch computer scientist Edsger W. Dijkstra, who coined the term"structured programming".

    0