Question

you wish to design a dungeon-crawl style video game which you can model as a directed graph. The dungeon is constructed of rooms, each of which has corridors that lead to other rooms. Each corridor (directed edge) in the dungeon has either a monster or an item of value, and you score positive or negative points depending on which is present. To win the game, you must find a path from room to room, from the entrance door s to the exit door t, such that your score is never negative at any point. You may assume that there is a path from the entrance doors to every room, and there is a path from every room to the exit door t. Design an efficient algorithm to determine if the path exists and find it if it exists. You should describe the main idea of your algorithm, and argue its correctness and time complexity

Answer 1

Here i am providing the code. Hope it helps. please give me a like. it helps me a lot.

class Room{
   private String name, description;
   private Room north, east, west, south;
  
   public Room(String name, String description) {
       this.name = name;
       this.description = description;
   }
  
   public String getExits() {
       String str="";
       //creating exit if the value is not null
       if(north!=null)
           str +="[N]orth: "+north.getName()+"\n";
       if(east != null)
           str+="[E]ast: "+east.getName()+"\n";
       if(west != null)
           str+="[W]est: "+west.getName()+"\n";
       if(south != null)
           str+="[S]outh: "+south.getName()+"\n";
      
       return str;
   }

   //all getters method
   public String getName() {
       return name;
   }

   public Room getNorth() {
       return north;
   }

   public Room getEast() {
       return east;
   }

   public Room getWest() {
       return west;
   }

   public Room getSouth() {
       return south;
   }
  
   //setters for exit
   public void setExits(Room n, Room e, Room w, Room s) {
       north = n;
       east = e;
       west = w;
       south = s;
   }

   @Override
   public String toString() {
       return name+"\n"+description+"\n"+getExits();
   }
}

public class Test {//driver class
public static void main(String[] args){
   Room hall = new Room("hall", "It's dark.");
   Room bed = new Room("Bed", "Tiny room.");
   Room bath = new Room("Bath", "Toilets here.");
   Room dine = new Room("Dining", "Table & chairs.");
   hall.setExits(bed, bath, dine, null);
   System.out.println(hall);
}
}

Output

<terminated Test (1) [Java Application] C:\Program Files Vava\jre1.8.0_211\bin\javaw.exe (19-Oct-2019, 9:46:19 am) hall It's dark. [N]orth: Bed [E]ast: Bath [W]est: Dining

Thank you. please upvote.