Answer Happy

Description: Create a working bi-directional weighted graph
class with all the standard methods for a data structure of that
type. Including breadth first search and depth first search.
Instructions:
● Loose coupling.
● Separation of interface from implementation.
● Developer testing.
● Best practices in procedural and object oriented
programming.
● Understanding of algorithms.
● Understanding of dynamic memory allocation, pointers, etc.
● Understanding of graphs.
● You must use a struct of some type to store
information in a vertex (node) similar to the ones we’ve used all
semester, but you can decide what “id” means and what data is
stored.
minimum of 5 separate files. main.h, main.cpp, graph.h,
graph.cpp, data.h.
please no previous used answers.