Universal Implementation of BFS, DFS, Dijkstra, and A-Star

I demonstrated that well-known algorithms BFS, DFS, Dijkstra, and A-Star are essentially variations of the same algorithm by creating a universal implementation.

Comment

Inspiration

The goal of the article was to show how relevant all traversing algorithms are to each other.

What it does

I have implemented a universal data-structure that handles all well-known types of Graph Traversal in one bunch.

Accomplishments that I'm proud of

Article has been Featured on Dzone Main and Data Engineering pages, reposted on Better Programming Medium Hub, gained a lot of attention on codeproject, hackernoon, and reposted on hash-node and dev.to.

Built With

  • algorithms
  • astar
  • bfs
  • c++
  • dfs
  • dijkstra
  • graph
Share this project:

Updates