A Bit About Dijkstra’s

Someone recently asked me about Dijkstra’s Algorithm – I thought I will write a short note, for the benefit of all students. The content here is from Introduction to Algorithm by CLRS, with a bit more detailed explanation. This book is called the “Bible of Algorithms”, that is, the best book to learn nearly all about algorithms. If you plan on continuing your education in Programming/Theoretical Computing, I would strongly suggest that you buy a copy for yourself. Buy it here or scroll down for more book suggestions.

Please check the challenges section at the end of the article. If you are interested in taking up any one of them, I can help you get started.

Since the article is a bit long, I have split it into pages – scroll down and click the next page number to continue reading.


  1. Contents
  2. Introduction
  3. Some Basic Prerequisites
  4. Algorithm
  5. Description and a Discussion on Greedy Strategy
  6. Sample Execution
  7. Some Prerequisites to Prove Correctness
  8. Correctness Theorem
  9. Applications
  10. Apps to See Algorithm in Action
  11. Some Challenges for Deeper Understanding
  12. A Bit of Mathematics and Side Notes
  13. About Edsger W. Dijkstra
  14. External Links to Wikipedia, for further reading.

Pages: ContentsNext Page >>

Graph Algorithms: Book Suggestions


One Comment Add yours

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s

This site uses Akismet to reduce spam. Learn how your comment data is processed.