Sign in

Things we will be talking about in the article:

  • What is DFS
  • Example of DFS
  • Applications of DFS
  • Analysis of DFS
  • What is BFS?
  • Example of BFS
  • Applications of BFS
  • Analysis of BFS
  • Summary

DFS and BFS are Graph traversal methods. So, what does graph traversal mean? Essentially, the thought is that we’ll be traversing around the graph starting with one vertex then onto the next and finding properties of their intertwined connections. DFS and BFS are two of the most common algorithms used for Graph Traversals. While both of them help us in traversal, they work completely differently. …

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store