Introduction to Graphs & Hashed Data Structures

Beginner
  • 9 videos | 55m 8s
  • Includes Assessment
  • Earns a Badge
Rating 4.3 of 63 users 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

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

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

Journey Data Structures and Algorithms in JavaScript
Rating 5.0 of 1 users Rating 5.0 of 1 users (1)
Course Graph Data Structures: Implementing Graph Traversal & Shortest Path Algorithms
Rating 4.6 of 16 users Rating 4.6 of 16 users (16)
Journey C
Rating 3.7 of 6 users Rating 3.7 of 6 users (6)

PEOPLE WHO VIEWED THIS ALSO VIEWED THESE

Course Data Structures & Algorithms in Python: Implementing Trees & Graphs
Rating 4.6 of 80 users Rating 4.6 of 80 users (80)
Course Software Development Concepts: Software Development Glossary
Rating 4.5 of 379 users Rating 4.5 of 379 users (379)
Course Introduction to Binary Trees & Sorting
Rating 4.4 of 204 users Rating 4.4 of 204 users (204)