[Solved] Following Figure Called Graph Circles Called Nodes Lines Called Edges Edge Connects Two No Q37210949

In C++

The following figure is called a graph. The circles are called nodes, and the lines are called edges. An edge connects two nodes. You can interpret the graph as a maze of rooms and passages. The nodes can be thought of as rooms and an edge connects one room to another. Note that each node has at most four edges in the following graph. START LFINISH Write a program implements the above maze using references to instances of a Node which contains the name of the node and four pointers, one for each of the directions (North n, South s, East e and West w). Each node in the graph will correspond to an instance of Node. The edges correspond to links that connect one node to another and can be represented as pointers to other nodes 0 Start the user at node A. The user’s goal is to reach the finish in node. The program should output possible moves in the north (n), south (s), east (e), or west (w) direction. Then the user inputs any of the four direction:s (n, s, e, w). After that your program checks whether that’s a valid move or not. If valid, it will usher her/him to the desired room, otherwise prints an error message and prompt again for desired direction You are in room A of a maze of twisty little passages, all alike. You can go east or south. Which direction would you like to go? e You are in room B of a maze of twisty little passages, all alike. You can go west or south. Which direction would you like to go? s You are in room F of a maze of twisty little passages, all alike. You can go north or east Which direction would you like to go? e You are in room G of a maze of twisty little passages, all alike. You can go north or east or west. Which direction would you like to go? s ERROR: No way! Please try either north or east or west. E You are in room H of a maze of twisty little passages, all alike. You can go north or south or west. Which direction would you like to go? s You are in room L. You have arrived at the finish point Good job! Show transcribed image text The following figure is called a graph. The circles are called nodes, and the lines are called edges. An edge connects two nodes. You can interpret the graph as a maze of rooms and passages. The nodes can be thought of as rooms and an edge connects one room to another. Note that each node has at most four edges in the following graph. START LFINISH Write a program implements the above maze using references to instances of a Node which contains the name of the node and four pointers, one for each of the directions (North n, South s, East e and West w). Each node in the graph will correspond to an instance of Node. The edges correspond to links that connect one node to another and can be represented as pointers to other nodes 0 Start the user at node A. The user’s goal is to reach the finish in node. The program should output possible moves in the north (n), south (s), east (e), or west (w) direction. Then the user inputs any of the four direction:s (n, s, e, w). After that your program checks whether that’s a valid move or not. If valid, it will usher her/him to the desired room, otherwise prints an error message and prompt again for desired direction
You are in room A of a maze of twisty little passages, all alike. You can go east or south. Which direction would you like to go? e You are in room B of a maze of twisty little passages, all alike. You can go west or south. Which direction would you like to go? s You are in room F of a maze of twisty little passages, all alike. You can go north or east Which direction would you like to go? e
You are in room G of a maze of twisty little passages, all alike. You can go north or east or west. Which direction would you like to go? s ERROR: No way! Please try either north or east or west. E You are in room H of a maze of twisty little passages, all alike. You can go north or south or west. Which direction would you like to go? s You are in room L. You have arrived at the finish point Good job!

Expert Answer

---

Answer to The following figure is called a graph. The circles are called nodes, and the lines are called edges. An edge connects t… . . .