Graphs - Data Structures Series #9
In this course, you will learn about the Graph data structure, create an undirected graph from zero in your preferred language, and practice coding challenges with it!
Topics
Syllabus
3 chapters14 lessons12 challengesIntroduction
2 lessonsGraph Project
7 lessons7Practice Challenges
5 lessons5More like this
Depth-First Search - Graph Algorithms
Master Depth-First Search, a fundamental way to explore a graph. Build the adjacency lookup, write an iterative DFS in your language of choice, analyze its O(V + E) complexity, and use it to count and measure connected components.
Certificate on completion
- 9
- 3
- 1
- 54
Breadth-First Search - Graph Algorithms
Master Breadth-First Search, the layer-by-layer graph traversal behind shortest paths. Build the neighbor lookup, write an iterative BFS with a queue in your language of choice, and use it to find shortest-path distances in unweighted graphs.
Certificate on completion
- 9
- 3
- 1
- 54
Hash Tables - Data Structures Series #4
In this course, you will learn about the Hash Table data structure, create a Hash Table from zero using your preferred language, and practice coding challenges with it!
Certificate on completion
- 14
- 12
Linked List - Data Structures Series #5
In this course, you will learn about the Linked List data structure, create a Linked List from zero using your preferred language, and practice coding challenges with it!
Certificate on completion
- 14
- 6
- 1
Dijkstra's Algorithm - Graph Algorithms
Master Dijkstra's Algorithm, the greedy single-source shortest-path method for graphs with non-negative weights. Read weighted edges, build the full distance computation in your language of choice, and answer point-to-point and farthest-vertex queries.
Certificate on completion
- 9
- 3
- 1
- 54