Graph Data Structures: Implementing Graph Traversal & Shortest Path Algorithms

What makes the graph data structure very interesting and powerful is the large number of algorithms that can be run on graphs to extract insights. Common graph algorithms include traversing a graph and computing the shortest path between nodes. Implementing these algorithms is a great way to learn how graphs are explored and optimized. In this course learn how graphs can be traversed by studying both depth-first and breadth-first graph traversal and discover how they can be implemented using a stack and a queue respectively. Next explore how to compute the shortest path in an unweighted graph. And finally use Dijkstra’s algorithm to compute the shortest path in a weighted graph. Upon completion of this course you will be able to implement optimal algorithms on graphs.