Question: This is Data Structures. Can someone do the JAVA code for the assignment above or change the code below into JAVA format? #include #include #include

This is Data Structures. Can someone do the JAVA code for

This is Data Structures. Can someone do the JAVA code for the assignment above or change the code below into JAVA format?

#include #include #include #include #include #include #include #include using namespace std; map name; vector name2; void bfs(vector> adj,int src,int dest) { cout> parent; vector v(adj.size()); parent.push_back(v);//parent parent.push_back(v);//weight till that node queue q; int i,n,el; n=adj.size(); for(i=0;i0&&parent[1][i]>parent[1][el]+adj[el][i]) { parent[1][i]=adj[el][i]+parent[1][el]; parent[0][i]=el; q.push(i); } } } cout> adj,int src,int dest) { cout> parent; vector v(adj.size()); parent.push_back(v);//parent parent.push_back(v);//weight till that node stack stk; int i,n,el; n=adj.size(); for(i=0;i0&&parent[1][i]>parent[1][el]+adj[el][i]) { parent[1][i]=adj[el][i]+parent[1][el]; parent[0][i]=el; stk.push(i); } } } cout> adj; vector v; cout>file; infile.open(file); getline(infile,s); ss>s) { name[s]=i; name2.push_back(s); i++; } std::map::iterator it=name.begin(); while(getline(infile,s)) { v.clear(); ss.clear(); ss>k) { v.push_back(k); } adj.push_back(v); } cout>src; cout>dest; bfs(adj,name.find(src)->second,name.find(dest)->second); dfs(adj,name.find(src)->second,name.find(dest)->second); return 0; }

BFS and DFS Assignment The paths between nodes are represented as an nxn matrix, where n is the number of nodes. Each slot in the matrix represent the weight of the path between corresponding nodes. Zero and Negative values represents non-exiting path. The matrix usually stored in a file in the following format, where the fist line representing the node names, and subsequence lines representing the weight between the any two nodes between the corresponding row and column. ABCDE F. 012021 100011 You are required to implement a program that: 1. Prompts the user to enter the name of the file containing the matrix, the name of the 2. Find and display a path (preferably shortest path ) between the starting node and the 3. Find and display a path (preferably shortest path ) between the starting node and the starting node, and the name of the ending node. ending node by Breath First Search ending node by Depth First Search Hints: it would be easier to handle your graph if each node is encapsulated with at least: node name, distance from the source node, and the preceding node name on the path for that distance BFS and DFS Assignment The paths between nodes are represented as an nxn matrix, where n is the number of nodes. Each slot in the matrix represent the weight of the path between corresponding nodes. Zero and Negative values represents non-exiting path. The matrix usually stored in a file in the following format, where the fist line representing the node names, and subsequence lines representing the weight between the any two nodes between the corresponding row and column. ABCDE F. 012021 100011 You are required to implement a program that: 1. Prompts the user to enter the name of the file containing the matrix, the name of the 2. Find and display a path (preferably shortest path ) between the starting node and the 3. Find and display a path (preferably shortest path ) between the starting node and the starting node, and the name of the ending node. ending node by Breath First Search ending node by Depth First Search Hints: it would be easier to handle your graph if each node is encapsulated with at least: node name, distance from the source node, and the preceding node name on the path for that distance

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer

Step: 1 Unlock blur-text-image

Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock

Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!

You are to create a Program that simulates a Database with Golfer information that is stored in a Binary Search Tree. Summary of program: Your program will start with reading an input file filled...

Hello, this is a project for a Data Structures class, I'm new to Java so I don't know a whole lot, so please, I would appreciate if you could help me with this one. I just need to finish up the code...

This is in C. The partial solution "template" for the assignment is provided below which is well commented. NO OTHER LANGUAGES WILL BE ACCEPTED. One technique for dealing with deadlock is called...

In C++, this project is to develop a simple database system. The database is to handle multiple records, each composed of several fields. The database will store its information to a file, addition...

C++ Programming Assignment Help needed ASAP For this C++ program can you please complete Time.cpp file using overloaded operators. Below are the screenshots that can you be helpful. So can you please...

I need desperate help on this, please. Java has many built-in features that allow for easier programming. Two of these features are the Math methods class and the StringBuilder class. These classes...

A c++ question, Problem Statement you are asked to develop a walk-in clinic patient system. The goal of this system is to manage the medical records of all the patients of the walk-in clinic. The...

[Data Structures] C++ Debug code for part A (errors in polynomial.cpp) and help w part B of exercise. /* * * * * * * * * * * * * * * * * * * * main.cpp * * * * * * * * * * * * * * * * * * * * * * /...

Documents Your wiki should consist of a set of documents. Each document has a title (which is unique among all documents in the wiki) and contents. Each document is a sequence of lines of plain text....

(JAVA - DATA STRUCTURES) Hi, THIS IS THE FOURTH TIME I HAVE POSTED THIS QUESTION AND NOBODY WANTS TO HELP ME. PLEASE, I NEED SOMEONE TO HELP ME. I need help with the program CountryDisplayer.java and...

During recessions, industries such as construction often cut back on employees. The newly unemployed workers may seek jobs for a while and then become discouraged if they do not find new jobs. a. If...

Given the earnings per share over the period 20052012 shown in the following table, determine the annual dividend per share under each of the policies set forth in parts a through d. a. Pay out 50%...

if a corporation issues 5 0 0 0 shares of 5 $ per value common for $ 9 5 , 0 0 0 the entry would include a credit to

Compared with half a century ago, adoption has become _ _ _ _ _ _ _ _ _ common, but it is more open and acceptabl e , so we probably discuss it _ _ _ _ _ _ _ . fill in the blanks more or much less or...

=+How will this affect the recruiting process?

=+assignment, what types of support programs would you expect or ask for?

=+how would you go about doing that and what characteristics would you look for to ensure success?