Midterm 3 Revision
Docsity.com
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Guidelines and tips
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Edsger Dijkstra and Shortest Path Algorithm, Slides of Data Structures and Algorithms
An overview of edsger dijkstra's contributions to computer science, specifically his algorithm for finding the shortest path between vertices in a weighted graph. Quotes from dijkstra, explanations of the shortest path problem and dijkstra's solution, and examples of dynamic programming and the principle of optimality. It also discusses the 0-1 knapsack problem and all-pairs shortest paths problem.
Typology: Slides
2012/2013
1 / 66
This page cannot be seen from the preview
Don't miss anything!
Related documents
Partial preview of the text
Download Edsger Dijkstra and Shortest Path Algorithm and more Slides Data Structures and Algorithms in PDF only on Docsity!
Midterm 3 Revision
Quotation
• "Computer science is no more about
computers than astronomy is about
telescopes."
• E. W. Dijkstra
Edsger Dijkstra made many more contributions to computer science than the algorithm that is named after him. He was Professor of Computer Sciences in the University of Texas