Subscribe to DSC Newsletter

While many of the programming libraries encapsulate the inner working details of graph and other algorithms, as a data scientist it helps a lot having a reasonably good familiarity of such details.  A solid understanding of the intuition behind such algorithms not only helps in appreciating the logic behind them but also helps in making conscious decisions about their applicability in real life cases.  There are several graph based algorithms and most notable are the shortest path algorithms.  Algorithms such as Dijkstra’s, Bellman Ford, A*, Floyd-Warshall and Johnson’s algorithms are commonly encountered.  While these algorithms are discussed in many text books and informative resources online, I felt that not many provided visual examples that would otherwise illustrate the processing steps to sufficient granularity enabling easy understanding of the working details.  As such, I had to use simple enough graphs to visualize the algorithmic flow for my own understanding and I wanted to share my examples along with the explanations through this article.  Since there are many algorithms to illustrate, I decided to divide the article into several parts.  In part 1, I have illustrated Dijkstra’s and Bellman-Ford algorithms.  Before diving into algorithms, I also wanted to highlight salient points on the graph data structure.

Content of this article:

  • Quick Primer On Graph Data Structure
  • Dijkstra’s Algorithm
  • Bellman-Ford Algorithm
  • More Algorithms To Cover

Read the full article here

Written by Murali Kashaboina, Tech. Executive, PhD Researcher AI/ML/DS, Data Scientist, Industry Speaker, Entrepreneur.

Views: 38


You need to be a member of AnalyticBridge to add comments!

Join AnalyticBridge

On Data Science Central

© 2021   TechTarget, Inc.   Powered by

Badges  |  Report an Issue  |  Privacy Policy  |  Terms of Service