Overview
In this lesson, we cover the basics of the node-based data structures known as graphs.
Prerequisites
- Big O Notation
- Linked Lists
- Binary Trees
Learning Objectives
By the end of this module, learners will be able to:
- Define a graph and understand the difference between undirected and directed graphs.
- Identify how graphs are used in programming.
- Implement a graph using an adjacency list.
Content
There are two components to this module:
- Lesson: Graphs
- Exercise: Implementing a Graph
Solution Code
- Exercise Solution: Implementing a Graph
Time to Complete
1.5 hours total:
- 0.5 hour - Graphs Lesson
- 1 hour - Implementing a Graph Exercise
Additional Resources
- Some graph data structure interview question topics: An article discussing common interview questions on graphs.
- Visualizations of breadth-first search and depth-first search in a graph structure.
- Common interview questions about graphs that don’t necessarily deal with coding.
- Practice building a graph visually: An interactive tool for visualizing and building graphs.
Internal resources
Find a 👾 bug 👾 or have suggestions? Let us know!