The names of the two input files as well as the output file are supposed to be provided as arguments. Could you please fix it? Thanks. DPriorityQueue.java: // Import the required classes import java....

Question

Question

The names of the two input files as well as the output file are supposed to be provided as arguments. Could you please fix it? Thanks. DPriorityQueue.java: // Import the required classes import java....

The names of the two input files as well as the output file are supposed to be provided as arguments. Could you please fix it? Thanks.

DPriorityQueue.java:

// Import the required classes
import java.io.*;
import java.util.*;

//Create the class
public class DPriorityQueue
{
//Declare the private members variables.
private int type1,type2;
private String CostInTime[][], SVertex, DVertex;
private List<String> listOfTheNodes;
private Set<String> List;
private List<Root> ListOfVisitedNode;
private HashMap<String, Integer> minimalDistance;
private HashMap<String, Integer> distOfVertices;
private PriorityQueue<City> priorityQueue;

// prove the definition of the function to create priority queue of the nodes
public DPriorityQueue(List<String> listOfTheNodes)
{
  this.listOfTheNodes = listOfTheNodes;
  minimalDistance = new HashMap<String,Integer>();
  distOfVertices = new HashMap<String,Integer>();
  List = new HashSet<String>();
  ListOfVisitedNode = new ArrayList<Root>();
  priorityQueue = new PriorityQueue<City>(new City());
}

// Find the neighboring node in the file
private void FindTheadjacent(String evaluationNode, Root evaluationNodeList)
{
int d = -1;
int newd = -1;

  for (int i = 0; i<CostInTime.length; i++)
  {
   if(!CostInTime[i][0].equals(evaluationNode))
    continue;
   String target;
   for (int j = 0; j < listOfTheNodes.size(); j++)
   {
    target = listOfTheNodes.get(j);
    if(!CostInTime[i][1].equals(target))
     continue;
    if (!List.contains(target))
    {
     d = Integer.parseInt(CostInTime[i][type1]);
     newd = minimalDistance.get(evaluationNode) + d;
     if (newd < minimalDistance.get(target))
     {
      minimalDistance.replace(target,newd);
      distOfVertices.replace(target,distOfVertices.get(evaluationNode) +
        Integer.parseInt(CostInTime[i][type2]));
      for (Root path : ListOfVisitedNode)
      {
       if(path.exists(target))
        path.delete(target);
       break;
      }
      evaluationNodeList.add(target);
     }
     priorityQueue.add(new City(target,minimalDistance.get(target)));
    }
   }
  }
}

// return the node which has the minimum distance
private String getVetex()
{
String node = priorityQueue.remove().city;
return node;
}

// Dijkstra,s algorithm definition
public void dijkastra(String costInTime[][], String requiredPath[])
{
  String vartexEvaluation;
  SVertex = requiredPath[0];
  DVertex = requiredPath[1];
  if(requiredPath[2].equalsIgnoreCase("C"))
  {
   type1 = 2;
   type2 = 3;
  }
  else
  {
   type1 = 3;
   type2 = 2;
  }

this.CostInTime = costInTime;

  for (String vertex:listOfTheNodes)
  {
   minimalDistance.put(vertex, Integer.MAX_VALUE);
   distOfVertices.put(vertex, Integer.MAX_VALUE);
  }

  priorityQueue.add(new City(SVertex, 0));
  minimalDistance.replace(SVertex,0);
  distOfVertices.replace(SVertex, 0);
  while (!priorityQueue.isEmpty())
  {
   vartexEvaluation = getVetex();
   Root evaluationNodeList = new Root();
   evaluationNodeList.setNode(vartexEvaluation);
   List.add(vartexEvaluation);
   FindTheadjacent(vartexEvaluation, evaluationNodeList);
   if(!isThereVertex(ListOfVisitedNode, vartexEvaluation))
    ListOfVisitedNode.add(evaluationNodeList);
  }
}
// Check the node in the file
private boolean isThereVertex(List<Root> listOfVisitedVertex, String node)
{
  for (Root p : ListOfVisitedNode)
  {
   if(p.getNode().equals(node))
    return true;
  }
  return false;
}

// Find the destination node in the file to complete the path.
private static List<String> PathofTheRoot(List<Root> visitedCity, String target)
{
  List<String> completePath = new ArrayList<String>();
  for( Root path : visitedCity)
  {
   if(!path.exists(target))
    continue;
   completePath = PathofTheRoot(visitedCity, path.getNode());
   completePath.add(target);
   return completePath;
  }
  completePath.add(target);
  return completePath;
}

// Start the main method of the program
public static void main(String[] arg) throws FileNotFoundException
{
  //Declare the variables.
  String timeCost[][],PathList[][];
  BufferedReader dataOfTheFlight, requestedData;
  List<String> listOfTheNode;
  PrintWriter out = new PrintWriter("output1.txt");

  try
  {
   // Read the data from the files
   dataOfTheFlight = new BufferedReader(new FileReader("FlightData1.txt"));
   requestedData = new BufferedReader(new FileReader("Requested.txt"));

String string;

   listOfTheNode = new ArrayList<String>();
   timeCost = new String[Integer.parseInt(dataOfTheFlight.readLine())][4];
   PathList = new String[Integer.parseInt(requestedData.readLine())][3];

int i=0,j; String _node;

   // Make tokens of the data of the flightData file
   while((string = dataOfTheFlight.readLine()) != null)
   {
    j=0;
    StringTokenizer data = new StringTokenizer(string,"|");
    int k = 1;
    while(k<=2)
    {
     if(!listOfTheNode.contains(_node = data.nextToken()))
     {
      timeCost[i][j++] = _node;
      listOfTheNode.add(_node);
     }
     else
      timeCost[i][j++] = _node;
     k++;
    }

    while(data.hasMoreTokens())
    {
     timeCost[i][j++] = data.nextToken();
    }
    i++;
   }
   i=0;

   // Make tokens of the data of the requestedFlightData file
   while((string = requestedData.readLine()) != null)
   {
    j=0;
    StringTokenizer data = new StringTokenizer(string,"|");
    while(data.hasMoreTokens())
     PathList[i][j++] = data.nextToken();
    i++;
   }

i=1;

   // Check the type of the cost
   for(String requsetedPath[] : PathList)
   {
    if(!(listOfTheNode.contains(requsetedPath[0])&& listOfTheNode.contains(requsetedPath[1])))
    {
     out.println("Path can not be find !!!!!");
     continue;
    }
    String _type,_otherType;

    if(requsetedPath[2].equals("T"))
    {
     _type = "Time";
     _otherType = "Cost";
    }

    else
    {
     _type = "Cost";
     _otherType = "Time";
    }

// Call the DijkstraPriorityQueue to make the priority queue.
DPriorityQueue priorityQueue = new DPriorityQueue(listOfTheNode);

// Call the dijkstra_algorithm method to run the Dijkstra's algorithm
priorityQueue.dijkastra(timeCost, requsetedPath);

    out.println("Flight "+i+": "+priorityQueue.SVertex+", "+
      priorityQueue.DVertex+" ("+_type+")");
    for (String vertex:listOfTheNode)
    {
     if(!vertex.equals(priorityQueue.DVertex))
      continue;
     List<String> list = PathofTheRoot(priorityQueue.ListOfVisitedNode,
       priorityQueue.DVertex);
     for (int k = 0; k < list.size(); k++)
     {
      if(k == list.size()-1 )
       out.print(list.get(k)+". ");
      else
       out.print(list.get(k)+" --> ");
     }
     out.println(_type+": " + priorityQueue.minimalDistance.get(vertex)+" "
       +_otherType+": "+priorityQueue.distOfVertices.get(vertex));
     break;
    }
    i++;
   }

  } catch (Exception e)
  {
   System.out.println("Exception has occured:" + e.toString());
  }
  out.close();
}
}

City.java:

//Import the class Comparator
import java.util.Comparator;
// Class
class City implements Comparator<City>
{
public String city;
public int cost;

public City()
{
}

// Compare the nodes.
@Override
public int compare(City node1, City node2)
{
  if (node1.cost < node2.cost)
   return -1;
  if (node1.cost > node2.cost)
   return 1;
  return 0;
}

public City(String city, int cost)
{
  this.city = city;
  this.cost = cost;
}
}

Root.java:

// Import the required classes
import java.util.ArrayList;
import java.util.List;
// Create the class
class Root
{
private List<String> root;
private String city;
// Get the node
public String getNode()
{
  return this.city;
}
// Add the node in the array List
public void add(String city)
{
  root.add(city);
}
//Delete the node from the list
public void delete(String city)
{
  root.remove(city);
}
// Check if the node exist or not
public Boolean exists(String city)
{
  if(root.contains(city))
   return true;
  return false;
}
//Create the arrayList
public Root()
{
  root = new ArrayList<String>();
}
// Set the node
public void setNode(String Node)
{
  this.city = Node;
}
}

FlightData1.txt

Requested.txt:

2
Dallas|Houston|T
Chicago|Dallas|C

engineering Computer-Science

Add a comment Improve this question Transcribed image text

Answer 1

Answer #1

--------------------------DPriorityQueue.java-------------------------

// Import the required classes

import java.io.*;

import java.util.*;

//Create the class

public class DPriorityQueue

{

//Declare the private members variables.

private int type1,type2;

private String CostInTime[][], SVertex, DVertex;

private List<String> listOfTheNodes;

private Set<String> List;

private List<Root> ListOfVisitedNode;

private HashMap<String, Integer> minimalDistance;

private HashMap<String, Integer> distOfVertices;

private PriorityQueue<City> priorityQueue;

// prove the definition of the function to create priority queue of the nodes

public DPriorityQueue(List<String> listOfTheNodes)

{

this.listOfTheNodes = listOfTheNodes;

minimalDistance = new HashMap<String,Integer>();

distOfVertices = new HashMap<String,Integer>();

List = new HashSet<String>();

ListOfVisitedNode = new ArrayList<Root>();

priorityQueue = new PriorityQueue<City>(new City());

}

// Find the neighboring node in the file

private void FindTheadjacent(String evaluationNode, Root evaluationNodeList)

{

int d = -1;

int newd = -1;

for (int i = 0; i<CostInTime.length; i++)

{

if(!CostInTime[i][0].equals(evaluationNode))

continue;

String target;

for (int j = 0; j < listOfTheNodes.size(); j++)

{

target = listOfTheNodes.get(j);

if(!CostInTime[i][1].equals(target))

continue;

if (!List.contains(target))

{

d = Integer.parseInt(CostInTime[i][type1]);

newd = minimalDistance.get(evaluationNode) + d;

if (newd < minimalDistance.get(target))

{

minimalDistance.replace(target,newd);

distOfVertices.replace(target,distOfVertices.get(evaluationNode) +

Integer.parseInt(CostInTime[i][type2]));

for (Root path : ListOfVisitedNode)

{

if(path.exists(target))

path.delete(target);

break;

}

evaluationNodeList.add(target);

}

priorityQueue.add(new City(target,minimalDistance.get(target)));

}

// return the node which has the minimum distance

private String getVetex()

{

String node = priorityQueue.remove().city;

return node;

}

// Dijkstra,s algorithm definition

public void dijkastra(String costInTime[][], String requiredPath[])

{

String vartexEvaluation;

SVertex = requiredPath[0];

DVertex = requiredPath[1];

if(requiredPath[2].equalsIgnoreCase("C"))

{

type1 = 2;

type2 = 3;

}

else

{

type1 = 3;

type2 = 2;

}

this.CostInTime = costInTime;

for (String vertex:listOfTheNodes)

{

minimalDistance.put(vertex, Integer.MAX_VALUE);

distOfVertices.put(vertex, Integer.MAX_VALUE);

}

priorityQueue.add(new City(SVertex, 0));

minimalDistance.replace(SVertex,0);

distOfVertices.replace(SVertex, 0);

while (!priorityQueue.isEmpty())

{

vartexEvaluation = getVetex();

Root evaluationNodeList = new Root();

evaluationNodeList.setNode(vartexEvaluation);

List.add(vartexEvaluation);

FindTheadjacent(vartexEvaluation, evaluationNodeList);

if(!isThereVertex(ListOfVisitedNode, vartexEvaluation))

ListOfVisitedNode.add(evaluationNodeList);

}

// Check the node in the file

private boolean isThereVertex(List<Root> listOfVisitedVertex, String node)

{

for (Root p : ListOfVisitedNode)

{

if(p.getNode().equals(node))

return true;

}

return false;

}

// Find the destination node in the file to complete the path.

private static List<String> PathofTheRoot(List<Root> visitedCity, String target)

{

List<String> completePath = new ArrayList<String>();

for( Root path : visitedCity)

{

if(!path.exists(target))

continue;

completePath = PathofTheRoot(visitedCity, path.getNode());

completePath.add(target);

return completePath;

}

completePath.add(target);

return completePath;

}

// Start the main method of the program

public static void main(String[] arg) throws FileNotFoundException

{

if( arg.length < 3 )

{

System.out.println("Error! Insufficient arguments");

System.exit(0);

}

//Declare the variables.

String timeCost[][],PathList[][];

BufferedReader dataOfTheFlight, requestedData;

List<String> listOfTheNode;

// PrintWriter out = new PrintWriter("output1.txt");

// set the file name with third command line argument

PrintWriter out = new PrintWriter(arg[2]);

try

{

// Read the data from the files

// dataOfTheFlight = new BufferedReader(new FileReader("FlightData1.txt"));

// set the file name with first command line argument

dataOfTheFlight = new BufferedReader(new FileReader(arg[0]));

// requestedData = new BufferedReader(new FileReader("Requested.txt"));

// set the file name with second command line argument

requestedData = new BufferedReader(new FileReader(arg[1]));

String string;

listOfTheNode = new ArrayList<String>();

timeCost = new String[Integer.parseInt(dataOfTheFlight.readLine())][4];

PathList = new String[Integer.parseInt(requestedData.readLine())][3];

int i=0,j; String _node;

// Make tokens of the data of the flightData file

while((string = dataOfTheFlight.readLine()) != null)

{

j=0;

StringTokenizer data = new StringTokenizer(string,"|");

int k = 1;

while(k<=2)

{

if(!listOfTheNode.contains(_node = data.nextToken()))

{

timeCost[i][j++] = _node;

listOfTheNode.add(_node);

}

else

timeCost[i][j++] = _node;

k++;

}

while(data.hasMoreTokens())

{

timeCost[i][j++] = data.nextToken();

}

i++;

}

i=0;

// Make tokens of the data of the requestedFlightData file

while((string = requestedData.readLine()) != null)

{

j=0;

StringTokenizer data = new StringTokenizer(string,"|");

while(data.hasMoreTokens())

PathList[i][j++] = data.nextToken();

i++;

}

i=1;

// Check the type of the cost

for(String requsetedPath[] : PathList)

{

if(!(listOfTheNode.contains(requsetedPath[0])&& listOfTheNode.contains(requsetedPath[1])))

{

out.println("Path can not be find !!!!!");

continue;

}

String _type,_otherType;

if(requsetedPath[2].equals("T"))

{

_type = "Time";

_otherType = "Cost";

}

else

{

_type = "Cost";

_otherType = "Time";

}

// Call the DijkstraPriorityQueue to make the priority queue.

DPriorityQueue priorityQueue = new DPriorityQueue(listOfTheNode);

// Call the dijkstra_algorithm method to run the Dijkstra's algorithm

priorityQueue.dijkastra(timeCost, requsetedPath);

out.println("Flight "+i+": "+priorityQueue.SVertex+", "+

priorityQueue.DVertex+" ("+_type+")");

for (String vertex:listOfTheNode)

{

if(!vertex.equals(priorityQueue.DVertex))

continue;

List<String> list = PathofTheRoot(priorityQueue.ListOfVisitedNode,

priorityQueue.DVertex);

for (int k = 0; k < list.size(); k++)

{

if(k == list.size()-1 )

out.print(list.get(k)+". ");

else

out.print(list.get(k)+" --> ");

}

out.println(_type+": " + priorityQueue.minimalDistance.get(vertex)+" "

+_otherType+": "+priorityQueue.distOfVertices.get(vertex));

break;

}

i++;

}

} catch (Exception e)

{

System.out.println("Exception has occured:" + e.toString());

}

out.close();

}

City.java:

//Import the class Comparator
import java.util.Comparator;
// Class
class City implements Comparator<City>
{
public String city;
public int cost;

public City()
{
}

// Compare the nodes.
@Override
public int compare(City node1, City node2)
{
  if (node1.cost < node2.cost)
   return -1;
  if (node1.cost > node2.cost)
   return 1;
  return 0;
}

public City(String city, int cost)
{
  this.city = city;
  this.cost = cost;
}
}

Root.java:

// Import the required classes
import java.util.ArrayList;
import java.util.List;
// Create the class
class Root
{
private List<String> root;
private String city;
// Get the node
public String getNode()
{
  return this.city;
}
// Add the node in the array List
public void add(String city)
{
  root.add(city);
}
//Delete the node from the list
public void delete(String city)
{
  root.remove(city);
}
// Check if the node exist or not
public Boolean exists(String city)
{
  if(root.contains(city))
   return true;
  return false;
}
//Create the arrayList
public Root()
{
  root = new ArrayList<String>();
}
// Set the node
public void setNode(String Node)
{
  this.city = Node;
}
}

FlightData1.txt

Requested.txt:

2
Dallas|Houston|T
Chicago|Dallas|C

Sample Output

$:Users RishablDesktop>javac DPriorityQueue.java C:\Users Rishab \Desktop>java DPriorityQueue FlightData1.txt Requested.txt ou$

---------------------Output1.txt-------------------

Flight 1: Dallas, Houston (Time)
Dallas --> Houston. Time: 51 Cost: 101
Flight 2: Chicago, Dallas (Cost)
Chicago --> Austin --> Dallas. Cost: 255 Time: 250

Add a comment

Answer 2

The names of the two input files as well as the output file are supposed to be provided as arguments. Could you please fix it? Thanks. DPriorityQueue.java: // Import the required classes import java....

Homework Answers

Add Answer to:
The names of the two input files as well as the output file are supposed to be provided as arguments. Could you please fix it? Thanks. DPriorityQueue.java: // Import the required classes import java....

Post as a guest

Earn Coins

I am getting this Error can you please fix my Java code. import java.awt.Dialog; import java.awt.Label;...

Please use Java programming: Modify both ArrayList and LinkedList classes and add the following method to...

Java help! Please help complete the min method below in bold. import java.util.Arrays; import java.util.ArrayList; import...

Please Modify TestPart2 to test the correctness and efficiency of FasterDefaultList. Thanks import java.util.List; import java.util.AbstractList;...

(Reading & Writing Business Objects) I need to have my Classes be able to talk to...

What is the output of the following program? import java.util.ArrayList; import java.util.Collections; import java.util.List; public class...

This is the question: These are in Java format. Comments are required on these two Classes...

Can anyone helps to create a Test.java for the following classes please? Where the Test.java will...

JAVA: How do I output all the data included for each employee? I can only get...

I've previously completed a Java assignment where I wrote a program that reads a given text...

The names of the two input files as well as the output file are supposed to be provided as arguments. Could you please fix it? Thanks. DPriorityQueue.java: // Import the required classes import java....

Homework Answers

Add Answer to: The names of the two input files as well as the output file are supposed to be provided as arguments. Could you please fix it? Thanks. DPriorityQueue.java: // Import the required classes import java....

Post as a guest

Earn Coins

Add Answer to:
The names of the two input files as well as the output file are supposed to be provided as arguments. Could you please fix it? Thanks. DPriorityQueue.java: // Import the required classes import java....