Graph Navigation & Shortest Path Finder in C++ | BFS, Graphs & Adjacency Matrix

In this video, I demonstrate my C++ Graph Navigation and Shortest Path Finder program, showing how graph data structures and Breadth-First Search (BFS) work together to navigate connected nodes. Rather than walking through every line of source code, I'll run the program and demonstrate its main features. *In this demonstration, we'll cover:* Adding edges to create connections between graph nodes. Displaying the graph using an adjacency matrix. Finding the shortest path between a starting node and a destination. Using Breadth-First Search (BFS) to explore nodes and find a path with the fewest edges in an unweighted graph. Navigating the program's interactive menu. *What you'll learn* This project demonstrates how graphs represent connections between objects and how BFS uses a queue to explore those connections systematically. The concepts covered are useful for understanding algorithms used in network traversal, social networks, navigation, and other applications involving connected data. Github: https://github.com/Dax-Meyer/CSC-6021... LinkedIn: https://lnkd.in/p/g-D2sAf6 If you're learning C++ and data structures, I hope this demonstration helps you better understand how graph algorithms work in a practical program.