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

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

C++ PROGRAM

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 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

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.
Transcribed Image Text: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.
1
5
2
Example
Input:
682
01
04
12
03
35
45
52
31
Output:
012
Transcribed Image Text:1 5 2 Example Input: 682 01 04 12 03 35 45 52 31 Output: 012
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Knowledge Booster
Heapsort
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education