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]

Java language

Manhattan skyline def manhattan_skyline(towers):This classic problem in computational geometry (essentially, geometry that can be done using only integer arithmetic; yes, that is an actual thing) is best illustrated by pictures and animations such as those on the page "The Skyline problem", so you can first check that it out to get an idea of what is going on. Given a list of rectangular towers as tuples (s, e, h) where s and e are the start and end x-coordinates (satisfying e>s) and h is the height of that tower, compute and return the total visible area of the towers, being careful not to double count two or more towers that are partially overlapping. All towers share the same flat ground baseline at the height.   The classic solution illustrates the important sweep line technique that starts by creating a list of precisely those x-coordinate values where something relevant to the problem takes place. In this problem, the relevant x-coordinates are those where some tower either…

Write a program that draws line segments using the arrow keys. The line starts from (100, 100) in the pane and draws toward east, north, west, or south when the right-arrow key, uparrow key, leftarrow key, or downarrow key is pressed, as shown in Figure 15.28b.

The equation of a parabola can be expressed in either standard form (y = ax? + bx + c) or vertex form (y = a(x – h)² + k). Write a program that prompts the user to enter a, b, and c as integers in standard 4ac – b and k -b form and displays h 2a | in the vertex form. Display h 4a and k as rational numbers. i

C++ language Write a program that asks the user to enter daily sale for five stores and record them in an array.The program should then display a bar graph comparing each store’s sales for all days of a week.Create each bar in the bar graph by displaying a row of asterisks. Each asterisk should representRs.1000 of sales. The program also calculates the total sale each day, and total sale of the week.Here is an example of the program s output.Enter day 1 sales for store 1: 4000 [Enter]Enter day 1 sales for store 2: 6000 [Enter]Enter day 1 sales for store 3: 10000 [Enter]Enter day 1 sales for store 4: 11000 [Enter] Enter day 1 sales for store 5: 3000 [Enter]Enter day 2 sales for store 1: 9000 [Enter]Enter day 2 sales for store 2: 8000 [Enter]Enter day 2 sales for store 3: 19000 [Enter]Enter day 2 sales for store 4: 7000 [Enter]Enter day 2 sales for store 5: 9000 [Enter]…(and so on.)Weekly SaleMonday: Total Sale: 34,000/-Store 1: **** (4000)Store 2: ****** (6000)Store 3: **********…

In the C programming language   Suppose you are given an array of integers. You want to insert a number x to the array and rearrange so that all the elements are less than or equal to x are before x, and the elements after x are greater than x. For example, suppose the list is {3, 2, 7, 0 1, 5}and x is 4, since3, 2, 0, and 1,are less than or equal to 4,7and 5 are greater than 4, the new array is {3, 2, 0, 1, 4, 7, 5}.The new array has the length of n+1 where n is the length of the input array.   Example input/output #1: Enter the length of the array: 10 Enter the elements of the array: 3 5 14 03 92 8 11 Enter the number for insertion: 3 Output: 3 1 0 3 2 3 5 4 9 8 11   Example input/output #2:  Enter the length of the array: 8 Enter the elements of the array: 5013 4 1 7 3 5 Enter the number for insertion: 6 Output: 5 0 4 1 356 13 7   1) Name your program arrays.c 2) Include the rearrange( ) function to rearrange the array:   void rearrange(int *a, int n, int insert, int *b);   a…

The following is useful as part of a program to play Minesweeper. Suppose you have a 5×5 list that consists of 0s and M's. Write a program that creates a new 5×5 list that has M's in the same place, but the Zeroes are replaced by counts of how many M's are in adjacent cells (adjacent either horizontally, vertically, or diagonally). An example is shown below. An example is shown below:

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 figure 20-6 on page 1414 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

Answer the given question with a proper explanation and step-by-step solution.