Introduction to Graphs & Hashed Data Structures

Beginner
  • 9 Videos | 55m 8s
  • Includes Assessment
  • Earns a Badge
Likes 7 Likes 7
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

  • Playable
    1. 
    Representing Graphs – Adjacency List
    3m 34s
    UP NEXT
  • Playable
    2. 
    Representing Graphs – Adjacency Matrix
    3m 51s
  • Locked
    3. 
    Graph Searching – Breadth First Search
    8m 33s
  • Locked
    4. 
    Graph Searching – Depth First Search
    9m 9s
  • Locked
    5. 
    Graph Sorting – Topological Sort
    10m 28s
  • Locked
    6. 
    Introduction to Hashed Data Structures
    1m 18s
  • Locked
    7. 
    Hashed Data Structures – The Hash Function
    6m 52s
  • Locked
    8. 
    Hashed Data Structures – Perfect vs Non-Perfect Hashing
    3m 47s
  • Locked
    9. 
    Hashed Data Structures – Handling Collisions
    7m 37s

EARN A DIGITAL BADGE WHEN YOU COMPLETE THIS COURSE

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

Digital badges are yours to keep, forever.