TRANSFORM THE C++ CODE BELOW INTO JAVA CODE. raw code:- #include using namespace std; using namespace std::chrono; //method to find countries between two cities using BFS traversal vector shortestpathusingbfs(map >&graph,string start,string end) { map >::iterator it; //creating a queue to store the cities queue q; q.push(start); //creating a map to store the visited cities map visited; visited[start]=true; //creating a vector to store the path map parent; parent[start]=""; //running a loop till the queue is empty while(!q.empty()) { //dequeing the city string s=q.front(); q.pop(); //checking if the city is the destination it=graph.find(s); if(it!=graph.end()) { //if the city is the destination vector::iterator it1; for(it1=it->second.begin();it1!=it->second.end();it1++) { //checking if the city is already visited if(!visited[*it1]) { visited[*it1]=true; q.push(*it1); parent[*it1]=s; } } } } //creating a vector to store the path vector path; string temp=end; //adding the destination city to the path while(temp!="") { //adding the city to the path path.push_back(temp); temp=parent[temp]; } //reversing the path reverse(path.begin(),path.end()); return path; } //method to find the shortest path between two cities using Dfs traversal vector shortestpathusingdfs(map> &graph, string start, string end, map &visited) { //creating a vector to store the path map>::iterator it; // vector path; //creating a stack to store the cities if (start == end) { path.push_back(start); return path; } visited[start] = true; it = graph.find(start); //checking if the city is present in the graph if (it != graph.end()) { //creating a vector to store the neighbours of the city vector::iterator it1; //running a loop till the vector is empty for (it1 = it->second.begin(); it1 != it->second.end(); it1++) { //checking if the city is already visited if (!visited[*it1]) { //if the city is not visited vector temp = shortestpathusingdfs(graph, *it1, end, visited); if (temp.size() > 0) { //adding the city to the path temp.push_back(start); if (path.size() == 0 || temp.size() < path.size()) { path = temp; } } } } } //returning the path return path; } int main() { //creating a map to store the graph fstream file; file.open("city.txt",ios::in); string s; //creating a map to store the graph map> m; //running a loop till the file is empty while(getline(file,s)) { stringstream ss(s); string city1,city2; ss>>city1>>city2; m[city1].push_back(city2); } file.close(); //creating a map to store the visited cities cout << "Path : " << endl; cout << "DFS: "; map visited; time_point start, end, start1, end1; start = system_clock::now(); //calling the method to find the shortest path using DFS traversal vector ans2 = shortestpathusingdfs(m, "Macau", "USA", visited); end = system_clock::now(); duration elapsed_seconds = end - start; for (int i = ans2.size()-1; i >=0; i--) { cout< ans1 = shortestpathusingbfs(m, "Macau", "USA"); end1 = system_clock::now(); duration elapsed_seconds1 = end1 - start1; for (int i = 0; i < ans1.size(); i++) { cout << ans1[i] << " "; } cout << endl; cout << "Time: "; cout << "DFS=" << elapsed_seconds.count() << " " << endl; cout<<"BFS="<

TRANSFORM THE C++ CODE BELOW INTO JAVA CODE. raw code:- #include using namespace std; using namespace std::chrono; //method to find countries between two cities using BFS traversal vector shortestpathusingbfs(map >&graph,string start,string end) { map >::iterator it; //creating a queue to store the cities queue q; q.push(start); //creating a map to store the visited cities map visited; visited[start]=true; //creating a vector to store the path map parent; parent[start]=""; //running a loop till the queue is empty while(!q.empty()) { //dequeing the city string s=q.front(); q.pop(); //checking if the city is the destination it=graph.find(s); if(it!=graph.end()) { //if the city is the destination vector::iterator it1; for(it1=it->second.begin();it1!=it->second.end();it1++) { //checking if the city is already visited if(!visited[it1]) { visited[it1]=true; q.push(it1); parent[it1]=s; } } } } //creating a vector to store the path vector path; string temp=end; //adding the destination city to the path while(temp!="") { //adding the city to the path path.push_back(temp); temp=parent[temp]; } //reversing the path reverse(path.begin(),path.end()); return path; } //method to find the shortest path between two cities using Dfs traversal vector shortestpathusingdfs(map> &graph, string start, string end, map &visited) { //creating a vector to store the path map>::iterator it; // vector path; //creating a stack to store the cities if (start == end) { path.push_back(start); return path; } visited[start] = true; it = graph.find(start); //checking if the city is present in the graph if (it != graph.end()) { //creating a vector to store the neighbours of the city vector::iterator it1; //running a loop till the vector is empty for (it1 = it->second.begin(); it1 != it->second.end(); it1++) { //checking if the city is already visited if (!visited[it1]) { //if the city is not visited vector temp = shortestpathusingdfs(graph, it1, end, visited); if (temp.size() > 0) { //adding the city to the path temp.push_back(start); if (path.size() == 0 || temp.size() < path.size()) { path = temp; } } } } } //returning the path return path; } int main() { //creating a map to store the graph fstream file; file.open("city.txt",ios::in); string s; //creating a map to store the graph map> m; //running a loop till the file is empty while(getline(file,s)) { stringstream ss(s); string city1,city2; ss>>city1>>city2; m[city1].push_back(city2); } file.close(); //creating a map to store the visited cities cout << "Path : " << endl; cout << "DFS: "; map visited; time_point start, end, start1, end1; start = system_clock::now(); //calling the method to find the shortest path using DFS traversal vector ans2 = shortestpathusingdfs(m, "Macau", "USA", visited); end = system_clock::now(); duration elapsed_seconds = end - start; for (int i = ans2.size()-1; i >=0; i--) { cout< ans1 = shortestpathusingbfs(m, "Macau", "USA"); end1 = system_clock::now(); duration elapsed_seconds1 = end1 - start1; for (int i = 0; i < ans1.size(); i++) { cout << ans1[i] << " "; } cout << endl; cout << "Time: "; cout << "DFS=" << elapsed_seconds.count() << " " << endl; cout<<"BFS="<

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Question

TRANSFORM THE C++ CODE BELOW INTO JAVA CODE.

raw code:-

#include<bits/stdc++.h> using namespace std; using namespace std::chrono; //method to find countries between two cities using BFS traversal vector<string > shortestpathusingbfs(map<string,vector<string> >&graph,string start,string end) { map<string,vector<string> >::iterator it; //creating a queue to store the cities queue<string> q; q.push(start); //creating a map to store the visited cities map<string,bool> visited; visited[start]=true; //creating a vector to store the path map<string,string> parent; parent[start]=""; //running a loop till the queue is empty while(!q.empty()) { //dequeing the city string s=q.front(); q.pop(); //checking if the city is the destination it=graph.find(s); if(it!=graph.end()) { //if the city is the destination vector<string>::iterator it1; for(it1=it->second.begin();it1!=it->second.end();it1++) { //checking if the city is already visited if(!visited[*it1]) { visited[*it1]=true; q.push(*it1); parent[*it1]=s; } } } } //creating a vector to store the path vector<string> path; string temp=end; //adding the destination city to the path while(temp!="") { //adding the city to the path path.push_back(temp); temp=parent[temp]; } //reversing the path reverse(path.begin(),path.end()); return path; } //method to find the shortest path between two cities using Dfs traversal vector<string> shortestpathusingdfs(map<string, vector<string>> &graph, string start, string end, map<string, bool> &visited) { //creating a vector to store the path map<string, vector<string>>::iterator it; // vector<string> path; //creating a stack to store the cities if (start == end) { path.push_back(start); return path; } visited[start] = true; it = graph.find(start); //checking if the city is present in the graph if (it != graph.end()) { //creating a vector to store the neighbours of the city vector<string>::iterator it1; //running a loop till the vector is empty for (it1 = it->second.begin(); it1 != it->second.end(); it1++) { //checking if the city is already visited if (!visited[*it1]) { //if the city is not visited vector<string> temp = shortestpathusingdfs(graph, *it1, end, visited); if (temp.size() > 0) { //adding the city to the path temp.push_back(start); if (path.size() == 0 || temp.size() < path.size()) { path = temp; } } } } } //returning the path return path; } int main() { //creating a map to store the graph fstream file; file.open("city.txt",ios::in); string s; //creating a map to store the graph map<string ,vector<string>> m; //running a loop till the file is empty while(getline(file,s)) { stringstream ss(s); string city1,city2; ss>>city1>>city2; m[city1].push_back(city2); } file.close(); //creating a map to store the visited cities cout << "Path : " << endl; cout << "DFS: "; map<string, bool> visited; time_point<system_clock> start, end, start1, end1; start = system_clock::now(); //calling the method to find the shortest path using DFS traversal vector<string> ans2 = shortestpathusingdfs(m, "Macau", "USA", visited); end = system_clock::now(); duration<double> elapsed_seconds = end - start; for (int i = ans2.size()-1; i >=0; i--) { cout<<ans2[i]<<" "; } cout << endl; cout << "BFS: "; start1 = system_clock::now(); //calling the method to find the shortest path using BFS traversal vector<string> ans1 = shortestpathusingbfs(m, "Macau", "USA"); end1 = system_clock::now(); duration<double> elapsed_seconds1 = end1 - start1; for (int i = 0; i < ans1.size(); i++) { cout << ans1[i] << " "; } cout << endl; cout << "Time: "; cout << "DFS=" << elapsed_seconds.count() << " " << endl; cout<<"BFS="<<elapsed_seconds1.count()<<endl; return 0; }

Expert Solution