When is a graph a tree? Write a program that will read from a file specified on the command line and determine from the graph's adjacency matrix whether or not it is a tree, Example: Ja.out graph.txt Output: The graph is a tree! Contents of graph.txt will be something like this: 5 01000 10111 01000 01000 01000

When is a graph a tree? Write a program that will read from a file specified on the command line and determine from the graph's adjacency matrix whether or not it is a tree, Example: Ja.out graph.txt Output: The graph is a tree! Contents of graph.txt will be something like this: 5 01000 10111 01000 01000 01000

EBK JAVA PROGRAMMING

9th Edition

ISBN:9781337671385

Author:FARRELL

Publisher:FARRELL

Chapter13: File Input And Output

Section: Chapter Questions

Problem 6RQ

See similar textbooks

Similar questions

PYTHON: Can you please help me to modify this code in a way that it prints out the same output as the image below. class Node:def __init__(self, key):self.left = Noneself.right = Noneself.val = key# this is the function for Inorderdef printInorder(root):if root:# here calling the left childprintInorder(root.left)# here printing the node dataprint(root.val, end=" "),# here calling the right childprintInorder(root.right)# this is the Preorder methoddef printPreorder(root):if root:# here printing the node dataprint(root.val, end=" "),# here calling the left childprintPreorder(root.left)# here calling the right childprintPreorder(root.right)# thsi is the postorder methoddef printPostorder(root):if root:# here calling the left childprintPostorder(root.left)# here calling the right childprintPostorder(root.right)# here printing the node dataprint(root.val, end=" "),# this is the main functionif __name__ == "__main__":root = Node('G')root.left = Node('D')root.right = Node('B')root.left.left…
INPUT: Your program will read an undirected graph representation from a file called graph.txt (text file). The first line contains a number, which is the number of vertices (n). We assume the vertices are 1,2,3,…, n The second line will show 2 distinct numbers between 1 and n. After these 2 lines, there will be the edges listed in separate lines with three numbers: The first two numbers represent the edge ends (undirected graph), while the third number is the weight for that edge. For example, the graph in Figure 8.4.7 is represented as follows: 6 16 122 141 233 251 451 362 562 The program will implement the Dijkstra’s Algorithm and OUTPUT [the shortest path] and [the total weight] between the 2 vertices in line 2, e.g., for the graph above it should output: [1,4,5,6] [4]
Convert Strings to Pig Latin using Linked ListPigLatinStrings converts a string into Pig Latin, but it processes only one word. If a word ends with apunctuation mark in the Pig Latin form, put the punctuation at the end of the string. For example:“Hello!” becomes “ello-Hay!”2.1 Write a program that prompts the user to input a string and then outputs the string in PigLatin. Create the program using a Linked List.a. Build a linked list as template either forwards or backwards. b. The linked list should have function that prints the linked list. This function should be arecursive function. c. Your program must store the characters of a string into a linked list and use thefunction Rotate to remove the first node of a linked list and put it at the end of thelinked list.
A Maze Room : In this lab, we will make a maze game. The maze is based on Linked Lists. Instead of having one possible direction (next), we will have 4 possible directions. Rooms: Use the below code as a basis to build your own room class. Implement this class in the file room.py A room will be the basic object for our maze game. A room can have 4 doors (pertaining to north, south, east, and west). Attached to each these directions we have either another room or None (we could also imagine that the None doors are just walls). We want the player to be able to tell what room they are in. Each room will have a unique description. When the player enters a room, the program will describe the room. This way the player will know if they went back to a room that have already been to. You MAY NOT change the method's arguments/names in ANY way. class Room():def __init__(self, descr):#Description of the room to print out#These should be unique so the player knows where they areself.descr =…
In C++, write a program that outputs the nodes of a graph in a breadth first traversal. Data File: Please use this data file. Text to copy: 100 1 3 -9991 4 -9992 5 -9993 2 -9994 -9995 7 8 -9996 4 7 -9997 -9998 -9999 7 8 -999 Diagram: Also, please take a look at the attached figure on and calculate the weights for the following edges: 0 -> 1 -> 4 0 -> 3 -> 2 -> 5 -> 7 0 -> 3 -> 2 -> 5 -> 8 6 -> 4 6 -> 7 9 -> 7 9 -> 8 To calculates these weights, please assume the following data: 0 -> 1 = 1 0 -> 3 = 2 1 -> 4 = 3 3 -> 2 = 4 2 -> 5 = 5 5 -> 7 = 6 5 -> 8 = 7 6 -> 4 = 8 6 -> 7 = 9 9 -> 7 = 10 9 -> 8 = 11
Write a Java program that asks the user to enter items until the user chooses to stop, stores them into links (nodes), and chains the links together into a linked list. You will need to make the following changes: Your linked list should store information about Customers' Transactions that contain three fields: customer name (string), customer number (int), and transaction description (string). Instead of putting all of your code inside the main source code file, you should create the following functions: o addToStart(Item x) o addToEnd(Itemn x) o insertAt(Item x, int n) o remove(int customer number) o reverse() o printList() • Instead of simply asking the user if they want to add a new link, your main program should offer the user a menu of options: o Add a new link to the end o Add a new link to the beginning o Insert an element at index n into the list. 0 Remove a link from the list o Reverse the list o print out the entire list o Quit the program
Write a Java program that incorporates a loop that prompts the user for student data. Student data are private fields in a student class including: String name String address double GPA Each student object is stored in a linked list. After the user completes the data entry, output the contents of the linked list in ascending sorted order by name to a regular text file that can be opened and viewed using a simple plain-text editor such as notepad. Validate numeric data for Grade Point Average (GPA).
Write a for loop to print all elements in courseGrades, following each element with a space (including the last). Print forwards, then backwards. End each loop with a newline. Ex: If courseGrades = {7, 9, 11, 10}, print: 7 9 11 10 10 11 9 7 Hint: Use two for loops. Second loop starts with i = courseGrades.length - 1. import java.util.Scanner; public class CourseGradePrinter {public static void main (String [ ] args) {Scanner scnr = new Scanner(System.in);final int NUM_VALS = 4;int [ ] courseGrades = new int[NUM_VALS];int i; for (i = 0; i < courseGrades.length; ++i) {courseGrades[i] = scnr.nextInt();} /* Your solution goes here */ }}
in netbeans using java Create a class NestedForPatternB. Use nested for-loops that display the following pattern:
In python. A program that analyzes a set of numbers can be very useful. Create an Analysis application thatprompts the user for numbers in the range 1 through 50, terminated by a sentinel, and then performsthe following analysis on the numbers:• Determine the average number• Determine the maximum number• Determine the range (maximum – minimum)• Determine the median (the number that occurs the most often)• Displays a bar graph called a histogram that shows the numbers in each five-unitrange (1–5, 6–10, 11-15, etc.). The histogram may look similar to:
Write a Java program that creates and maintains a binary search tree (BST) whose nodes are student records. Each student record (BST node) contains the student's id (String), name (String) and GPA (float). Use the student id as a key for the BST. The program starts with an empty BST and offers the following menu options to the user repeatedly until the user selects the 'Q' option (quit). A: Add a new student record to the BST. Here the user is prompted to enter the new student’s id, name and GPA. The program should display an error message if the student id already exists in the BST. F: Find a student record. Here the user is prompted to enter the id of the student to be searched. If found the program displays the student id, name and GPA, otherwise the program displays an error message. D: Delete a student record. Here the user is prompted to enter the id of the student record to be deleted. The program should display an error message if the student id is not found in the BST. P:…
Write a program that asks user to enter number of vertices in an undirected graph and then the adjacency matrix representing the undirected graph. The program, then, must display whether the given graph is connected or not. Sample 1Enter number of vertices: 3Enter adjacency matrix:0 1 11 0 01 0 0The graph is connected.