Dijkstra’s algorithm: Difference between revisions

Latest revision as of 19:30, 18 September 2017

This is student work which has not yet been approved as correct by the instructor

Case study notes^[1]

Introduction[edit]

The algorithm was conceived by Edsger Dijkstra in 1956. It is a path finding algorithm that is used to find the shortest path between points on a grid. It is often used in GPSs to help drivers find their way.

^[2]

How does it work or a deeper look[edit]

“For a given source node in the graph, the algorithm finds the shortest path between that node and every other.It can also be used for finding the shortest paths from a single node to a single destination node by stopping the algorithm once the shortest path to the destination node has been determined. For example, if the nodes of the graph represent cities and edge path costs represent driving distances between pairs of cities connected by a direct road, Dijkstra's algorithm can be used to find the shortest route between one city and all other cities.”

Examples[edit]

When you are meeting friends at a restaurant downtown and you use a gps app, the app uses Dijkstra’s Algorithm to test all available routes. Then it chooses the one that would be the quickest and easiest for you to take.

Pictures, diagrams[edit]

Pictures and diagrams go a LONG way to helping someone understand a topic. Especially if your topic is a little abstract or complex. Using a picture or diagram is a two part process:

External links[edit]

It would be helpful
to include many links
to other internet resources
to help fellow students
Please make sure the content is good
and don't link to a google search results, please

References[edit]

[1] ttp://www.flaticon.com/

[2] ttps://en.wikipedia.org/wiki/Dijkstra%27s_algorithm

[1]

[2]

@@ Line 9: / Line 9: @@
 == Introduction ==
-The algorithm was conceived by Edsger Dijkstra in 1956. It is a path finding algorithm that is used to find the shortest path between points on a grid. It is often used in GPSs to help drivers find their way
+The algorithm was conceived by Edsger Dijkstra in 1956. It is a path finding algorithm that is used to find the shortest path between points on a grid. It is often used in GPSs to help drivers find their way.
   <ref> https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm </ref>
@@ Line 15: / Line 15: @@
 == How does it work or a deeper look ==
-* If you are discussing a THING YOU CAN TOUCH, you must explain how it works, and the parts it is made of. Google around for an "exploded technical diagram" of your thing, [http://cdiok.com/wp-content/uploads/2012/01/MRI-Technology.jpg maybe like this example of an MRI]  It is likely you will reference outside links. Please attribute your work.
+“For a given source node in the graph, the algorithm finds the shortest path between that node and every other.It can also be used for finding the shortest paths from a single node to a single destination node by stopping the algorithm once the shortest path to the destination node has been determined. For example, if the nodes of the graph represent cities and edge path costs represent driving distances between pairs of cities connected by a direct road, Dijkstra's algorithm can be used to find the shortest route between one city and all other cities.”
-* If you are discussing a PROCESS OR ABSTRACT CONCEPT (like [[fuzzy logic]]) you must deeply explain how it works.
 == Examples ==
-Please include some example of how your concept is actually used. Your example must include WHERE it is used, and WHAT IS BENEFIT of it being used.
+When you are meeting friends at a restaurant downtown and you use a gps app, the app uses Dijkstra’s Algorithm to test all available routes. Then it chooses the one that would be the quickest and easiest for you to take.
 == Pictures, diagrams ==