CLL is mоre cоmmоn in Western countries thаn in Asiа.
Yоu must creаte а AdjаcencyMatrix class that has a parameterized cоnstructоr 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: . Write C++ code or pseudocode for the class, the constructor and a function called findPath that takes in two vertices and returns true if there is a path between the values and false if not. You must store the graph as an adjacency matrix using a 2D vector (a vector of vectors) or a 2D array that stores the complete representation of the Adjacency Matrix including unconnected edges represented with weight, 0. Example: Input vector describing indices (starting vertex, ending vertex) of the location in vector and the value (weight) at the index in format {starting vertex, ending vertex, weight}: { {0, 1, 5}, {0, 2, 4}, {1, 0, 1}, {2, 3, 8}, {3, 1, 2} } What your adjacency matrix should look like: 0 1 2 3 0 0 5 4 0 1 1 0 0 0 2 0 0 0 8 3 0 2 0 0 Output of findPath(1, 3): True You do not have to give us the path, just whether or not one exists (1 -> 0 -> 2 -> 3) 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.