This project requires the implementation of a graph data structure in C++, including nodes, edges, and traversal algorithms. The assignment involves creating a graph class that stores nodes, each with associated edges and weights. The project necessitates implementing depth-first search (DFS) and breadth-first search (BFS) algorithms to traverse the graph. The program should read graph data from input files, allowing users to specify start nodes and display the traversal results. The solution includes the implementation of node and graph classes, along with functions for inserting edges, performing DFS and BFS, and searching the graph. The project requires handling file input, managing node connections, and displaying the graph's contents. The solution should provide clear demonstrations of the implemented algorithms using provided datasets. The assignment also includes testing the implementation with provided data files and demonstrating the functionality of the developed graph class, including the ability to perform searches and display the graph's structure. The solution should be well-documented and demonstrate a clear understanding of graph data structures and algorithms.