Today, graphs are used constantly in numerous programs to model and represent network-like structures. With the inherent properties of graphs as well as the numerous graph algorithms that exist, we are able to solve problems such as the shortest distance between nodes or finding the most optimal and cheapest path to traverse each node. During my time at Grace Hopper, we learned graph traversal algorithms such as DFS using recursion and BFS using queues. …

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