# Introduction to Graphs & Hashed Data Structures

Beginner
• 9 videos | 55m 8s
• Includes Assessment
Rating 4.3 of 63 users (63)
Learn about graphing in C++, including the adjacency list and matrix, searching, and topological sorting. In addition, explore hashed data structures, including the hash function, perfect and non-perfect hashing, and handling collisions.

## WHAT YOU WILL LEARN

• Define a graph as an adjacency list in c++
Define a graph as an adjacency matrix in c++
Perform a breadth first search (bfs) on a graph represented by an adjacency list in c++
Perform a depth first search (dfs) on a graph represented by an adjacency matrix in c++
Implement a topological sort in c++ to sort a graph represented by an adjacency list
• Define a hashed data structure and discuss when to best use them
Implement a custom hash function in c++
Discuss the difference between perfect and non-perfect hashing, and implement a perfect hash in c++
Discuss the method of handling collisions using separate chaining

## IN THIS COURSE

• In this video, you will learn how to define a graph as an adjacency list in C++.
• In this video, you will learn how to define a graph as an adjacency matrix in C++.
• 3.  Graph Searching – Breadth First Search
Find out how to perform a Breadth First Search (BFS) on a graph represented by an adjacency list in C++.
• 4.  Graph Searching – Depth First Search
In this video, you will perform a Depth First Search (DFS) on a graph represented by an adjacency matrix in C++.
• 5.  Graph Sorting – Topological Sort
In this video, you will learn how to implement a Topological Sort in C++ to sort a graph represented by an adjacency list.
• 6.  Introduction to Hashed Data Structures
In this video, you will define a hashed data structure and discuss when it is best to use them.
• 7.  Hashed Data Structures – The Hash Function
In this video, find out how to implement a custom hash function in C++.
• 8.  Hashed Data Structures – Perfect vs Non-Perfect Hashing
Learn how to discuss the difference between perfect and non-perfect hashing, and implement a perfect hash in C++.
• 9.  Hashed Data Structures – Handling Collisions
In this video, learn how to discuss the method of handling collisions using separate chaining.

## EARN A DIGITAL BADGE WHEN YOU COMPLETE THIS COURSE

Skillsoft is providing you the opportunity to earn a digital badge upon successful completion on some of our courses, which can be shared on any social network or business platform.

Digital badges are yours to keep, forever.

## YOU MIGHT ALSO LIKE

Rating 4.5 of 26 users (26)
Rating 4.6 of 62 users (62)
Rating 4.0 of 4 users (4)

## PEOPLE WHO VIEWED THIS ALSO VIEWED THESE

Rating 4.5 of 206 users (206)
Rating 4.5 of 379 users (379)
Rating 4.6 of 274 users (274)