You must create a AdjacencyMatrix class that has a construct…
You must create a AdjacencyMatrix class that has a constructor that takes in a vector of vectors that have 3 elements each that represent a directed graph. The structure of each inner vector is as follows: starting vertex, ending vertex, weight. Code the class, the constructor and a function called findPath that takes in two vertices and should return true if there is a path between the values and false if not. Vertices will start at 1 and all vectors are one-indexed (the ones given to you and the ones you should create). Example: Input vector: { {1, 2, 5}, {1, 3, 4}, {2, 1, 1}, {3, 4, 8}, {4, 2, 2} } What your adjacency matrix should look like: 1 2 3 4 1 0 5 4 0 2 1 0 0 0 3 0 0 0 8 4 0 2 0 0 Output of findPath(2, 4): True You do not have to give us the path, just whether or not one exists (2 -> 1 -> 3 -> 4) In the text entry box, please switch from Paragraph mode to Preformatted mode to make your answer easier to read. Use spaces, not tabs, for indentation.