Please help, this is done using c++

Project #3-Traversing Property Graphs Learning Objectives Implement a data structure to meet given specifications Design, implement, and use a graph data structure Perform analysis of algorithm performance * e Utilize Dijkstra's algorithm Overview Your task for this assignment is to implement a graph data structure and find appropriate shortest paths, while accounting for property-labelled edges The Graph class At this point in the course, I leave it to your discretion to choose an appropriate implementation (i.e. array vs linked). Note that you may need a class for Nodes or Edges. Furthermore, you may use vectors, hashtables, or any other data structure used in class. Any manually implemented classes beyond the Graph shall be inline bool Graph: : construct (string filename)-construct the graph from the file called filename and return false if the graph construction failed. The file will have the following structure Alice Brent Calvin Deborah Everett Frank ParentOf Project #3-Traversing Property Graphs Learning Objectives Implement a data structure to meet given specifications Design, implement, and use a graph data structure Perform analysis of algorithm performance * e Utilize Dijkstra's algorithm Overview Your task for this assignment is to implement a graph data structure and find appropriate shortest paths, while accounting for property-labelled edges The Graph class At this point in the course, I leave it to your discretion to choose an appropriate implementation (i.e. array vs linked). Note that you may need a class for Nodes or Edges. Furthermore, you may use vectors, hashtables, or any other data structure used in class. Any manually implemented classes beyond the Graph shall be inline bool Graph: : construct (string filename)-construct the graph from the file called filename and return false if the graph construction failed. The file will have the following structure Alice Brent Calvin Deborah Everett Frank ParentOf