Question

Hello, i need help with this homework:

ml ALT -i (Body) - 11 - A Ă Aa Ao IŲ - x x A-D-A- AaBbcc AaBbCcDc Normal 1 No Spac- Font 5 Paragraph CSIT 254 -- Programming Lab 9-Graphs Purpose To work with an adjacency matrix for a Weighted Graph A Working 'Model of a Non-Weighted Graph In the .zip files 'ProgLabo9GraphsSum 18.zip' and 'ProgLabo9GraphsSum18_non_netbeans.zip' are a series of files. . Graph.java is an implementation of a non-weighted graph using an adjacency matrix Undirected NonWeighted ExampleSlide17.java is a 'driver' that has implemented the undirected non-weighted graph from slide 17 (see a later page) and uses Graph. It allows the 'user' to meander around the Graph. Undirected Non Weighted ExampleSlide 19House.java is a driver that has implemented the undirected non-weighted graph from slide 19 (see a later page) and uses Graph. It allows the 'user' to meander around the Graph. Implement WeightedGraph and use it in a program. In the zip files is WeightedGraph.java and DirectedWeightedExampleSlide18.java. The WeightedGraph.java has only stubs implemented. Add the fields Fill in the constructor Complete the 9 methods The DirectedWeightedExampleSlide18.java has the statements to create the directed weighted graph from slide 18 Add the logic to allow the user to meander around the graph th

Code provided:

public class DirectedWeightedExampleSlide18
{
public static void main(String[] args)
{
int currentVertex, userChoice;
Scanner input = new Scanner(System.in);

// create graph using your WeightedGraph based on author's Graph
WeightedGraph myGraph = new WeightedGraph(4);

// add labels
myGraph.setLabel(0,"Spot zero");
myGraph.setLabel(1,"Spot one");
myGraph.setLabel(2,"Spot two");
myGraph.setLabel(3,"Spot three");

// Add each edge (this directed Graph has 5 edges,
// so we add 5 edges)
myGraph.addEdge(0,2,9);

myGraph.addEdge(1,0,7);

myGraph.addEdge(2,3,12);

myGraph.addEdge(3,0,15);
myGraph.addEdge(3,1,6);

// let's pretend we are on v2
currentVertex = 2;
  
  
// do - this is a good place for the top of the loop

// display the current vertex

System.out.println("\nYou are currently at vertex " + currentVertex +
"-" + myGraph.getLabel(currentVertex));

// who are our neighbors?
System.out.println("neighbors of " + currentVertex + " are:\n");

System.out.printf("%3s %-10s %4s\n","#","Neighbor","Cost");
System.out.printf("%3s %-10s %4s\n","===","==========","====");

if (myGraph.neighbors(currentVertex).length == 0)
System.out.println("No Neighbors");
else
{
for (int neighbor : myGraph.neighbors(currentVertex))
{
System.out.printf("%3d %-10s %4d\n",
neighbor,
myGraph.getLabel(neighbor),
myGraph.getWeight(currentVertex,neighbor));
}
System.out.println();
}

// suppose I was interacting with user,
// I could ask for their choice

/* 1: if their choice is -1 then say goodbye
2: else if the user enters a value too large or too small report an out of range error
3: else if their choice is a valid neighbor then change the current vertex to that choice
4: else then report the vertex they entered is unreachable

hint for 3:
else if myGraph.isEdge(currentVertex,choice)
currentVertex=choice;
*/
  
// while...this is a good place for the bottom of the loop
  
System.out.println("\nyou need to modify this file: \n\tDirectedWeightedExampleSlide18.java"+
"\npress enter to continue...");
input.nextLine();
}
}

public class UndirectedNonWeightedExampleSlide17
{
public static void main(String[] args)
{
int currentVertex, userChoice;
Scanner input = new Scanner(System.in);

// create graph using Author's Graph
Graph myGraph = new Graph(4);

// add labels
myGraph.setLabel(0,"Spot zero");
myGraph.setLabel(1,"Spot one");
myGraph.setLabel(2,"Spot two");
myGraph.setLabel(3,"Spot three");

// Add each edge (this undirected Graph has 5 edges,
// so we add 10 edges)
myGraph.addEdge(0,1);
myGraph.addEdge(1,0);

myGraph.addEdge(0,2);
myGraph.addEdge(2,0);

myGraph.addEdge(0,3);
myGraph.addEdge(3,0);

myGraph.addEdge(1,3);
myGraph.addEdge(3,1);

myGraph.addEdge(2,3);
myGraph.addEdge(3,2);

// let's pretend we are on v2
currentVertex = 2;

  
do
{
// display the current vertex
System.out.println("\nYou are currently at node "
+ currentVertex + "-" + myGraph.getLabel(currentVertex));

// display our neighbors
System.out.println("neighbors of " + currentVertex + " are:");

for (int neighbor : myGraph.neighbors(currentVertex))
System.out.printf("%2d-%s\n",neighbor,myGraph.getLabel(neighbor));
System.out.println();

// suppose I was interacting with user, (hey, I am)
// I will ask for their choice
System.out.print("\nWhere would you like to go? (-1 to exit): ");
userChoice = input.nextInt();

// make sure not too small nor too big
while (userChoice < -1 || userChoice >= myGraph.size())
{
System.out.println("\n" + userChoice + " is not a valid value");
System.out.print("\nWhere would you like to go? (-1 to exit): ");
userChoice = input.nextInt();
}

// if their choice is -1 then exit
if (userChoice == -1)
System.out.println("Good bye!");
else
{
// if their choice is a valid neighbor
if (myGraph.isEdge(currentVertex,userChoice))
currentVertex=userChoice; // then move to new vertex....
else
// report the vertex they entered is unreachable
System.out.println("\nYou can't go to " + userChoice
+ "-" + myGraph.getLabel(userChoice)
+ " from " + currentVertex
+ "-" + myGraph.getLabel(currentVertex));
}
} while (userChoice != -1);
}
}

public class UndirectedNonWeightedExampleSlide19House
{
public static void main(String[] args)
{
int currentVertex, userChoice;
Scanner input = new Scanner(System.in);
final int KITCHEN = 0;
final int PANTRY = 1;
final int DINING_ROOM = 2;
final int BACK_FOYER = 3;
final int FRONT_FOYER = 4;
final int STUDY = 5;
final int LIVING_ROOM = 6;

// create graph using Author's Graph
Graph myGraph = new Graph(7);

// add labels
myGraph.setLabel(KITCHEN,"Kitchen");
myGraph.setLabel(PANTRY,"Pantry");
myGraph.setLabel(DINING_ROOM,"Dining Room");
myGraph.setLabel(BACK_FOYER,"Back Foyer");
myGraph.setLabel(FRONT_FOYER,"Front Foyer");
myGraph.setLabel(STUDY,"Study");
myGraph.setLabel(LIVING_ROOM,"Living Room");

// Add each edge (this undirected Graph has 7 edges,
// so we add 14 edges)
myGraph.addEdge(KITCHEN,PANTRY);
myGraph.addEdge(PANTRY,KITCHEN);

myGraph.addEdge(PANTRY,DINING_ROOM);
myGraph.addEdge(DINING_ROOM,PANTRY);

myGraph.addEdge(DINING_ROOM,FRONT_FOYER);
myGraph.addEdge(FRONT_FOYER,DINING_ROOM);

myGraph.addEdge(KITCHEN,BACK_FOYER);
myGraph.addEdge(BACK_FOYER,KITCHEN);

myGraph.addEdge(BACK_FOYER,FRONT_FOYER);
myGraph.addEdge(FRONT_FOYER,BACK_FOYER);

myGraph.addEdge(FRONT_FOYER,LIVING_ROOM);
myGraph.addEdge(LIVING_ROOM,FRONT_FOYER);

myGraph.addEdge(BACK_FOYER,STUDY);
myGraph.addEdge(STUDY,BACK_FOYER);

// let's pretend we are in FRONT_FOYER
currentVertex = FRONT_FOYER;

do
{
// display the current vertex
System.out.println("\nYou are currently in room "
+ currentVertex + "-" + myGraph.getLabel(currentVertex));

// display our neighbors
System.out.println("neighbors of " + currentVertex + " are:");

for (int neighbor : myGraph.neighbors(currentVertex))
System.out.printf("%2d-%s\n",neighbor,myGraph.getLabel(neighbor));
System.out.println();

// suppose I was interacting with user, (hey, I am)
// I will ask for their choice
System.out.print("\nWhere would you like to go? (-1 to exit): ");
userChoice = input.nextInt();

// make sure not too small nor too big
while (userChoice < -1 || userChoice >= myGraph.size())
{
System.out.println("\n" + userChoice + " is not a valid value");
System.out.print("\nWhere would you like to go? (-1 to exit): ");
userChoice = input.nextInt();
}

// if their choice is -1 then exit
if (userChoice == -1)
System.out.println("Good bye!");
else
{
// if their choice is a valid neighbor
if (myGraph.isEdge(currentVertex,userChoice))
currentVertex=userChoice; // then move to new vertex....
else
// report the vertex they entered is unreachable
System.out.println("\nYou can't go to " + userChoice
+ "-" + myGraph.getLabel(userChoice)
+ " from " + currentVertex
+ "-" + myGraph.getLabel(currentVertex));
}
} while (userChoice != -1);
}

public class Graph
{
private boolean[ ][ ] edges;
private Object[ ] labels;

/**
* Constructor
* @param n the number of nodes for the graph being created
*/
public Graph(int n)
{
edges = new boolean[n][n]; // All values initially false
labels = new Object[n]; // All values initially null
}

/**
* addEdge method receives 2 locations. The second location is added
* as a neighbor to the first Location passed.
* @param source Location to receive a neighbor
* @param target Location to be added as a neighbor
*/
public void addEdge(int source, int target)
{
edges[source][target] = true;
}

/**
* getLabel returns the label associated with the vertex passed
* @param vertex the vertex that we want the label for
* @return the label for the vertex
*/
public Object getLabel(int vertex)
{
return labels[vertex];
}

/**
* isEdge method receives 2 Locations. the second Location is checked
* to see if it is a neighbor of the first Location
* @param source Location to check for a neighbor
* @param target other Location that is being checked to see if it is a neighbor
* @return boolean that indicates if the second Location is a neighbor of the first Location
*/
public boolean isEdge(int source, int target)
{
return edges[source][target];
}

/**
* the neighbors method builds an array of Location which are the neighbors of
* the Location passed
* @param vertex the Location to get the neighbors from
* @return an array of int that contains the neighbors of vertex
*/
public int[ ] neighbors(int vertex)
{
int i;
int count;
int[ ] answer;

// First count how many edges have the vertex as their source
count = 0;
for (i = 0; i < labels.length; i++)
{
if (edges[vertex][i])
count++;
}

// Allocate the array for the answer
answer = new int[count];

// Fill the array for the answer
count = 0;
for (i = 0; i < labels.length; i++)
{
if (edges[vertex][i])
answer[count++] = i;
}

return answer;
}

/**
* removeEdge method receives 2 locations. The second location is removed
* as a neighbor to the first Location passed.
* @param source Location to lose a neighbor
* @param target Location to be removed as a neighbor
*/
public void removeEdge(int source, int target)
{
edges[source][target] = false;
}

/**
* setLabel assigns a label associated with the vertex passed
* @param vertex the vertex that we want to set the label for
* @param newLabel the label for the vertex
*/
public void setLabel(int vertex, Object newLabel)
{
labels[vertex] = newLabel;
}

/**
* size method returns the number of vertices in the graph
* @return number of vertices
*/
public int size( )
{
return labels.length;
}

}

public class ProgLab09GraphsSum18
{

/**
* @param args the command line arguments
*/
public static void main(String[] args)
{
String userChoice;
Scanner input = new Scanner(System.in);
  
do
{
System.out.println("\nThese use Graph.java (provided)");
System.out.println("A - UndirectedNonWeightedExampleSlide17.java");
System.out.println("B - UndirectedNonWeightedExampleSlide19House.java");
System.out.println("\nThis uses WeightedGraph.java (<--you need to modify)");
System.out.println("C - DirectedWeightedExampleSlide18.java (<--you need to modify)");
System.out.println("\nX - Exit");
System.out.print("\nEnter selection: ");
  
userChoice = input.nextLine();
switch (userChoice.toLowerCase())
{
case "a":
UndirectedNonWeightedExampleSlide17.main(args);
break;
case "b":
UndirectedNonWeightedExampleSlide19House.main(args);
break;
case "c":
DirectedWeightedExampleSlide18.main(args);
break;
case "x":
System.out.println("\nBye bye!");
break;
default:
System.out.println("\nhuh?");
  
}
} while (!(userChoice.equalsIgnoreCase("X")));  
}
}

public class WeightedGraph
{
public WeightedGraph(int n)
{
// stub
}

public void addEdge(int source, int target, int weight)
{
// stub
}
  
public Object getLabel(int vertex)
{
// stub
return null;
}
  
public boolean isEdge(int source, int target)
{
// stub
return false;
}
  
public int[ ] neighbors(int vertex)
{
// stub
int [ ] answer = { };
return answer;
}
  
public void removeEdge(int source, int target)
{
// stub
}
public void setLabel(int vertex, Object newLabel)
{
// stub
}
  
public int size( )
{
// stub
return 0;
}

public int getWeight(int source, int target)
{
// stub
return 0;
}
  
public void setWeight(int source, int target, int weight)
{
// stub
}
  
  
}

Answer 1

Working code implemented in Java and appropriate comments provided for better understanding:

Here I am attaching code for these files:

• Graph.java
• WeightedGraph.java
• ProgLab09GraphsSum18.java
• DirectedWeightedExampleSlide18.java
• UndirectedNonWeightedExampleSlide17.java
• UndirectedNonWeightedExampleSlide19House.java

Source code for Graph.java:

public class Graph
{
private boolean[ ][ ] edges;
private Object[ ] labels;

/**
* Constructor
* @param n the number of nodes for the graph being created
*/
public Graph(int n)
{
edges = new boolean[n][n]; // All values initially false
labels = new Object[n]; // All values initially null
}

/**
* addEdge method receives 2 locations. The second location is added
* as a neighbor to the first Location passed.
* @param source Location to receive a neighbor
* @param target Location to be added as a neighbor
*/
public void addEdge(int source, int target)
{
edges[source][target] = true;
}

/**
* getLabel returns the label associated with the vertex passed
* @param vertex the vertex that we want the label for
* @return the label for the vertex
*/
public Object getLabel(int vertex)
{
return labels[vertex];
}

/**
* isEdge method receives 2 Locations. the second Location is checked
* to see if it is a neighbor of the first Location
* @param source Location to check for a neighbor
* @param target other Location that is being checked to see if it is a neighbor
* @return boolean that indicates if the second Location is a neighbor of the first Location
*/
public boolean isEdge(int source, int target)
{
return edges[source][target];
}

/**
* the neighbors method builds an array of Location which are the neighbors of
* the Location passed
* @param vertex the Location to get the neighbors from
* @return an array of int that contains the neighbors of vertex
*/
public int[ ] neighbors(int vertex)
{
int i;
int count;
int[ ] answer;

// First count how many edges have the vertex as their source
count = 0;
for (i = 0; i < labels.length; i++)
{
if (edges[vertex][i])
count++;
}

// Allocate the array for the answer
answer = new int[count];

// Fill the array for the answer
count = 0;
for (i = 0; i < labels.length; i++)
{
if (edges[vertex][i])
answer[count++] = i;
}

return answer;
}

/**
* removeEdge method receives 2 locations. The second location is removed
* as a neighbor to the first Location passed.
* @param source Location to lose a neighbor
* @param target Location to be removed as a neighbor
*/
public void removeEdge(int source, int target)
{
edges[source][target] = false;
}

/**
* setLabel assigns a label associated with the vertex passed
* @param vertex the vertex that we want to set the label for
* @param newLabel the label for the vertex
*/
public void setLabel(int vertex, Object newLabel)
{
labels[vertex] = newLabel;
}

/**
* size method returns the number of vertices in the graph
* @return number of vertices
*/
public int size( )
{
return labels.length;
}

}

Source code for WeightedGraph.java:

public class WeightedGraph
{
private int edges[][];
private Object[] labels;
  
public WeightedGraph(int n)
{
edges = new int[n][n];
labels = new Object[n];
}

public void addEdge(int source, int target, int weight)
{
edges[source][target] = weight;
}
  
public Object getLabel(int vertex)
{
return labels[vertex];
}
  
public boolean isEdge(int source, int target)
{
if (edges[source][target] > 0)
return true;
else
return false;
}
  
public int[ ] neighbors(int vertex)
{
int i;
int count;
int [ ] answer = { };
  
count = 0;
for (i = 0; i < labels.length; i++)
{
if (edges[vertex][i] > 0)
count++;
}
  
answer = new int[count];
  
count = 0;
for (i = 0; i < labels.length; i++)
{
if (edges[vertex][i] > 0)
answer[count++] = i;
}
  
return answer;
}
  
public void removeEdge(int source, int target)
{
edges[source][target] = 0;
}
public void setLabel(int vertex, Object newLabel)
{
labels[vertex] = newLabel;
}
  
public int size( )
{
return labels.length;
}

public int getWeight(int source, int target)
{
return edges[source][target];
}
  
public void setWeight(int source, int target, int weight)
{
edges[source][target] = weight;
}
  
  
}

Source code for ProgLab09GraphsSum18.java:

import java.util.Scanner;

public class ProgLab09GraphsSum18
{

/**
* @param args the command line arguments
*/
public static void main(String[] args)
{
String userChoice;
Scanner input = new Scanner(System.in);
  
do
{
System.out.println("\nThese use Graph.java (provided)");
System.out.println("A - UndirectedNonWeightedExampleSlide17.java");
System.out.println("B - UndirectedNonWeightedExampleSlide19House.java");
System.out.println("\nThis uses WeightedGraph.java (<--you need to modify)");
System.out.println("C - DirectedWeightedExampleSlide18.java (<--you need to modify)");
System.out.println("\nX - Exit");
System.out.print("\nEnter selection: ");
  
userChoice = input.nextLine();
switch (userChoice.toLowerCase())
{
case "a":
UndirectedNonWeightedExampleSlide17.main(args);
break;
case "b":
UndirectedNonWeightedExampleSlide19House.main(args);
break;
case "c":
DirectedWeightedExampleSlide18.main(args);
break;
case "x":
System.out.println("\nBye bye!");
break;
default:
System.out.println("\nhuh?");
  
}
} while (!(userChoice.equalsIgnoreCase("X")));
  
  
}
  
}

Source code for DirectedWeightedExampleSlide18.java:

import java.util.Scanner;

public class DirectedWeightedExampleSlide18
{
public static void main(String[] args)
{
int currentVertex, userChoice, previous, totalCost;
Scanner input = new Scanner(System.in);

// create graph using your WeightedGraph based on author's Graph
WeightedGraph myGraph = new WeightedGraph(4);

// add labels
myGraph.setLabel(0,"Spot zero");
myGraph.setLabel(1,"Spot one");
myGraph.setLabel(2,"Spot two");
myGraph.setLabel(3,"Spot three");

// Add each edge (this directed Graph has 5 edges,
// so we add 5 edges)
myGraph.addEdge(0,2,9);

myGraph.addEdge(1,0,7);

myGraph.addEdge(2,3,12);

myGraph.addEdge(3,0,15);
myGraph.addEdge(3,1,6);

// let's pretend we are on v2
currentVertex = 2;
previous = 2;
totalCost = 0;
  
// do - this is a good place for the top of the loop
do
{
totalCost += myGraph.getWeight(previous, currentVertex);
System.out.println("\nso far you have accrued " + totalCost + " cost");
  
// display the current vertex

System.out.println("\nYou are currently at vertex " + currentVertex +
"-" + myGraph.getLabel(currentVertex));

// who are our neighbors?
System.out.println("neighbors of " + currentVertex + " are:\n");

System.out.printf("%3s %-10s %4s\n","#","Neighbor","Cost");
System.out.printf("%3s %-10s %4s\n","===","==========","====");

if (myGraph.neighbors(currentVertex).length == 0)
System.out.println("No Neighbors");
else
{
for (int neighbor : myGraph.neighbors(currentVertex))
{
System.out.printf("%3d %-10s %4d\n",
neighbor,
myGraph.getLabel(neighbor),
myGraph.getWeight(currentVertex,neighbor));
}
System.out.println();
}

// suppose I was interacting with user, (hey, I am)
// I will ask for their choice
System.out.print("\nWhere would you like to go? (-1 to exit): ");
userChoice = input.nextInt();

// make sure not too small nor too big
while (userChoice < -1 || userChoice >= myGraph.size())
{
System.out.println("\n" + userChoice + " is not a valid value");
System.out.print("\nWhere would you like to go? (-1 to exit): ");
userChoice = input.nextInt();
}

// if their choice is -1 then exit
if (userChoice == -1)
System.out.println("Good bye!");
else
{
// if their choice is a valid neighbor
if (myGraph.isEdge(currentVertex,userChoice))
{
previous = currentVertex;
currentVertex=userChoice; // then move to new vertex....
}
else
// report the vertex they entered is unreachable
System.out.println("\nYou can't go to " + userChoice
+ " from " + currentVertex);
}
} while (userChoice != -1);
}
}

Source code for UndirectedNonWeightedExampleSlide17.java:

import java.util.Scanner;

public class UndirectedNonWeightedExampleSlide17
{
public static void main(String[] args)
{
int currentVertex, userChoice;
Scanner input = new Scanner(System.in);

// create graph using Author's Graph
Graph myGraph = new Graph(4);

// add labels
myGraph.setLabel(0,"Spot zero");
myGraph.setLabel(1,"Spot one");
myGraph.setLabel(2,"Spot two");
myGraph.setLabel(3,"Spot three");

// Add each edge (this undirected Graph has 5 edges,
// so we add 10 edges)
myGraph.addEdge(0,1);
myGraph.addEdge(1,0);

myGraph.addEdge(0,2);
myGraph.addEdge(2,0);

myGraph.addEdge(0,3);
myGraph.addEdge(3,0);

myGraph.addEdge(1,3);
myGraph.addEdge(3,1);

myGraph.addEdge(2,3);
myGraph.addEdge(3,2);

// let's pretend we are on v2
currentVertex = 2;

  
do
{
// display the current vertex
System.out.println("\nYou are currently at node "
+ currentVertex + "-" + myGraph.getLabel(currentVertex));

// display our neighbors
System.out.println("neighbors of " + currentVertex + " are:");

for (int neighbor : myGraph.neighbors(currentVertex))
System.out.printf("%2d-%s\n",neighbor,myGraph.getLabel(neighbor));
System.out.println();

// suppose I was interacting with user, (hey, I am)
// I will ask for their choice
System.out.print("\nWhere would you like to go? (-1 to exit): ");
userChoice = input.nextInt();

// make sure not too small nor too big
while (userChoice < -1 || userChoice >= myGraph.size())
{
System.out.println("\n" + userChoice + " is not a valid value");
System.out.print("\nWhere would you like to go? (-1 to exit): ");
userChoice = input.nextInt();
}

// if their choice is -1 then exit
if (userChoice == -1)
System.out.println("Good bye!");
else
{
// if their choice is a valid neighbor
if (myGraph.isEdge(currentVertex,userChoice))
currentVertex=userChoice; // then move to new vertex....
else
// report the vertex they entered is unreachable
System.out.println("\nYou can't go to " + userChoice
+ "-" + myGraph.getLabel(userChoice)
+ " from " + currentVertex
+ "-" + myGraph.getLabel(currentVertex));
}
} while (userChoice != -1);
}
}

Source code for UndirectedNonWeightedExampleSlide19House.java:

import java.util.Scanner;

public class UndirectedNonWeightedExampleSlide19House
{
public static void main(String[] args)
{
int currentVertex, userChoice;
Scanner input = new Scanner(System.in);
final int KITCHEN = 0;
final int PANTRY = 1;
final int DINING_ROOM = 2;
final int BACK_FOYER = 3;
final int FRONT_FOYER = 4;
final int STUDY = 5;
final int LIVING_ROOM = 6;

// create graph using Author's Graph
Graph myGraph = new Graph(7);

// add labels
myGraph.setLabel(KITCHEN,"Kitchen");
myGraph.setLabel(PANTRY,"Pantry");
myGraph.setLabel(DINING_ROOM,"Dining Room");
myGraph.setLabel(BACK_FOYER,"Back Foyer");
myGraph.setLabel(FRONT_FOYER,"Front Foyer");
myGraph.setLabel(STUDY,"Study");
myGraph.setLabel(LIVING_ROOM,"Living Room");

// Add each edge (this undirected Graph has 7 edges,
// so we add 14 edges)
myGraph.addEdge(KITCHEN,PANTRY);
myGraph.addEdge(PANTRY,KITCHEN);

myGraph.addEdge(PANTRY,DINING_ROOM);
myGraph.addEdge(DINING_ROOM,PANTRY);

myGraph.addEdge(DINING_ROOM,FRONT_FOYER);
myGraph.addEdge(FRONT_FOYER,DINING_ROOM);

myGraph.addEdge(KITCHEN,BACK_FOYER);
myGraph.addEdge(BACK_FOYER,KITCHEN);

myGraph.addEdge(BACK_FOYER,FRONT_FOYER);
myGraph.addEdge(FRONT_FOYER,BACK_FOYER);

myGraph.addEdge(FRONT_FOYER,LIVING_ROOM);
myGraph.addEdge(LIVING_ROOM,FRONT_FOYER);

myGraph.addEdge(BACK_FOYER,STUDY);
myGraph.addEdge(STUDY,BACK_FOYER);

// let's pretend we are in FRONT_FOYER
currentVertex = FRONT_FOYER;

do
{
// display the current vertex
System.out.println("\nYou are currently in room "
+ currentVertex + "-" + myGraph.getLabel(currentVertex));

// display our neighbors
System.out.println("neighbors of " + currentVertex + " are:");

for (int neighbor : myGraph.neighbors(currentVertex))
System.out.printf("%2d-%s\n",neighbor,myGraph.getLabel(neighbor));
System.out.println();

// suppose I was interacting with user, (hey, I am)
// I will ask for their choice
System.out.print("\nWhere would you like to go? (-1 to exit): ");
userChoice = input.nextInt();

// make sure not too small nor too big
while (userChoice < -1 || userChoice >= myGraph.size())
{
System.out.println("\n" + userChoice + " is not a valid value");
System.out.print("\nWhere would you like to go? (-1 to exit): ");
userChoice = input.nextInt();
}

// if their choice is -1 then exit
if (userChoice == -1)
System.out.println("Good bye!");
else
{
// if their choice is a valid neighbor
if (myGraph.isEdge(currentVertex,userChoice))
currentVertex=userChoice; // then move to new vertex....
else
// report the vertex they entered is unreachable
System.out.println("\nYou can't go to " + userChoice
+ "-" + myGraph.getLabel(userChoice)
+ " from " + currentVertex
+ "-" + myGraph.getLabel(currentVertex));
}
} while (userChoice != -1);
}

}

Sample Output Screenshots:

Hope it helps, if you like the answer give it a thumbs up. Thank you.