C++ PROGRAM USE THE DRIVER CODE ATTACHED BELOW // { Driver Code Starts #include using namespace std; // }Driver Code Ends class Solution { public: // Function to return a path vector consisting of vertex ids from vertex 0 to target vector shortestPath(int V, vector adj[], int target) { // Enter your code here! } }; // { Driver Code Starts int main() { int tc; cin >> tc; while (tc--) { int V, E, target; cin >> V >> E >> target; vector adj[V]; for (int i = 0; i < E; i++) { int u, v; cin >> u >> v; adj[u].push_back(v); // adj[v].push_back(u); } // string s1; // cin>>s1; Solution obj; vector ans = obj. shortestPath(V, adj, target); for (int i = 0; i < ans.size(); i++) { cout << ans[i] << " "; } cout << endl; } return 0; } // } Driver Code Ends
C++
USE THE DRIVER CODE ATTACHED BELOW
// { Driver Code Starts
#include<bits/stdc++.h>
using namespace std;
// }Driver Code Ends
class Solution {
public:
// Function to return a path
// Enter your code here!
}
};
// { Driver Code Starts
int main() {
int tc;
cin >> tc;
while (tc--) {
int V, E, target;
cin >> V >> E >> target;
vector adj[V];
for (int i = 0; i < E; i++)
{ int u, v; cin >> u >> v;
adj[u].push_back(v);
// adj[v].push_back(u);
} // string s1;
// cin>>s1;
Solution obj;
vector ans = obj. shortestPath(V, adj, target);
for (int i = 0; i < ans.size(); i++) { cout << ans[i] << " "; } cout << endl; } return 0; } // } Driver Code Ends
![3. Given a directed graph. The task is to find a shortest path from vertex 0
to a target vertex v. You may adapt Breadth First Traversal of this
graph starting from 0 to achieve this goal. (40 points)
Note: One can move from node u to node v only if there's an edge from
u to v and find the BFS traversal of the graph starting from the Oth
vertex, from left to right according to the graph. Also, you should only
take nodes directly or indirectly connected from Node 0 in consideration.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F7028049e-abdc-40e8-9584-27ef962878b6%2F08acfc76-406b-4138-987f-e63294e5a8e4%2F87olk3b_processed.jpeg&w=3840&q=75)
![1
5
2
Example
Input:
682
01
04
12
03
35
45
52
31
Output:
012](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F7028049e-abdc-40e8-9584-27ef962878b6%2F08acfc76-406b-4138-987f-e63294e5a8e4%2Fscgihpj_processed.jpeg&w=3840&q=75)
![](/static/compass_v2/shared-icons/check-mark.png)
Step by step
Solved in 2 steps with 1 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
![C How to Program (8th Edition)](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
![Database Systems: Design, Implementation, & Manag…](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
![Programmable Logic Controllers](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)