Write a C++ program that takes an adjacency matrix of the graphunder GRAPH FOR PROJECT” in “POWER POINTS & DOCS”. Use thismatrix find all paths from vertex A to vertex G, and to find theshortest path from vertex A to vertex G. The adjacency matrix is a2 x 2 array. . NOTE: your program must find the path. Then outputthe path. 3 points extra if your program takes any origin vertexand destination vertex entered by user.
Solution