Write a program to create a weighted graph. The user inputs how many vertices, how many edges, the starting and ending vertices, and weight of each edge, then print the adjacency matrix. For example, if the user wants to create such a graph, 1 3 The running process looks like this: >Enter the Number of Vertices: 4 Enter the Number of Edges: 4 Enter The Graph Egdes 1 24 1 3 1 1 43 245 The adjacency matrix for given graph is: 1 2 3 4 10 4 1 3 24 005 31 000 43500 Please note: in un-weighted graph, if the adjacency matrix is A, A[i][j]-1 means node i is connected to node j. A[i][j]-0 means node i is not connected to node j. In weighted graph, if the adjacency matrix is A, A[i][i]-k means node i is connected to node j and the weight of the edge

Write a program to create a weighted graph. The user inputs how many vertices, how many edges, the starting and ending vertices, and weight of each edge, then print the adjacency matrix. For example, if the user wants to create such a graph, 1 3 The running process looks like this: >Enter the Number of Vertices: 4 Enter the Number of Edges: 4 Enter The Graph Egdes 1 24 1 3 1 1 43 245 The adjacency matrix for given graph is: 1 2 3 4 10 4 1 3 24 005 31 000 43500 Please note: in un-weighted graph, if the adjacency matrix is A, A[i][j]-1 means node i is connected to node j. A[i][j]-0 means node i is not connected to node j. In weighted graph, if the adjacency matrix is A, A[i][i]-k means node i is connected to node j and the weight of the edge

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter10: Classes And Data Abstraction

Section: Chapter Questions

Problem 23PE

See similar textbooks

Similar questions

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.
This is a python program Sales Bar GraphWrite a program that reads in the sales for five stores from a data file.Use the data to create a bar graph as follows:SALES BAR GRAPH:(Each * = $100)Store 1: *******Store 2: *********Store 3: ***********Store 4: *****Store 5: *******Snack Bar MenuWrite a program that allows the user to choose from the following menu untilhe/she chooses to exit. The program should keep a running total of the chargesand then add 6% sales tax to calculate the final bill. Display the total to theuser.1) Personal Pizza $6.002) Pretzel $2.503) Chips $1.254) Hot Dog $3.755) ExitInput validation: The user must choose 1 - 5 from the menu.Example Output:Welcome to Yum Yum Snack Bar!Please choose from the following menu:1) Personal Pizza $6.002) Pretzel $2.503) Chips $1.254) Hot Dog $3.755) ExitEnter your choice here: 1Current total: $6.00 Please choose from the following menu:1) Personal Pizza $6.002) Pretzel $2.503) Chips $1.254) Hot Dog $3.755) ExitEnter your choice…
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
Write a program that prints an mxn matrix whose dimensions are specified by the user. Let the matrix values be random variables. You must use it within the repetition cycle. Example format: Enter dimension of matrix mxn: 2 4 The 2x4 matrix is : 1 2 3 4 5 6 7 8
please code in python You place a pawn at the top left corner of an n-by-n chess board, labeled (0,0). For each move, you have a choice: move the pawn down a single space, or move the pawn down one space and right one space. That is, if the pawn is at position (i,j), you can move the pawn to (i+1,j) or (i+1, j+1). Ask the user for the size of a chessboard, n (integer). Find the number of different paths starting from (0,0) that the pawn could take to reach each position on the chess board. For example, there are two different paths the pawn can take to reach (2,1). Look at the diagrams below to convince yourself of this. You can see the four paths that you can take by move 2. Start -> Move 1 -> Move 2 (0,0) -> (1,0) -> (2,1) (0,0) -> (1,0) -> (2,0) (0,0) -> (1,1) -> (2,1) (0,0) -> (1,1) -> (2,2) Print the board with the number of ways to reach each square labeled as shown below. For example: Enter a board size: 4 1 0 0 0 1 1 0 0 1 2 1 0 1 3 3 1
Write a program that asks the user to enter today’s sales for five stores. The programshould then display a bar graph comparing each store’s sales. Create each bar in the bargraph by displaying a row of asterisks. Each asterisk should represent $100 of sales.Here is an example of the program’s output.Enter today's sales for store 1: 1000 [Enter]Enter today's sales for store 2: 1200 [Enter]Enter today's sales for store 3: 1800 [Enter]Enter today's sales for store 4: 800 [Enter]Enter today's sales for store 5: 1900 [Enter]SALES BAR CHART(Each * = $100)Store 1: **********Store 2: ************Store 3: ******************Store 4: ********Store 5: *******************
You are competing in a hedge race The maze is described as a graph with a start, goal, edge lengths, and two types of edges: regular paths in the maze, and hedges which one can crawl through. (Some parts of the maze are too thick to crawl through.) Design an algorithm which finds the shortest path to the goal, as quickly as possible
Programming Language: C++ Create a pseudocode (if you not familiar with this, you can create a program) that check if "directed graph" is actually circle graph. The meaning of circle is that let's say there is 1~6 nodes. The graph start with 1 and only can move to 2, and 2 can only move to 3....etc and after you hit 6, you move back to 1. so 1=>2=>3=>4=>5=>6=>1 this is example of circle directd graph. Please create a pseudocode/program to check if graph is circle or not. Also, include the time complexity of your pseudocode by [Worst case time complexity / Best case time complexity]
Write a program that asks the user to enter today’s sales rounded to the nearest $100 for each of three stores. The program should then display a bar graph comparing each store’s sales. Create each bar in the graph by displaying a row of asterisks. Each asterisk should represent $100 of sales. Here is an example of the program’s output. User input is shown in bold. Enter today’s sales for store 1: 1000[Enter]Enter today’s sales for store 2: 1200[Enter]Enter today’s sales for store 3: 900[Enter]DAILY SALES (each * = $100)Store 1: **********Store 2: ************Store 3: *********
Given below are two statements: S1: If a Graph G is n colorable then it's also n+1 colorable. S2: Every Bipartite graph is 2 colorable Which of the above statement(s) is/are correct?
with T=4, n=12 and A=(3,5,8,8,9,16,29,41,50,63,64,67). Draw the corresponding walkthrough as shown
Union-Find: Maze Write a program that generates mazes of arbitrary size using the union-find algorithm. A simple algorithm to generate the maze is to start by creating an N x M grid of cells separated by walls on all sides, except for entrance and exit. Then continually choose a wall randomly, and knock it down if the cells are not already connected to each other. If we repeat the process until the starting and ending cells are connected, we have a maze. It is better to continue knocking down the walls until every cell is reachable from every cell as this would generate more false leads in the maze. Test you algorithm by creating a 15 x 15 grid, and print all the walls that have been knocked down. D