1) Write a "C" program that finds and prints all the paths (if exists) between the given two cities according to the graph below. This code also calculates and prints the minimum distance between the given two cities. Pay attention to the loops. 1264km Prague Beijing 4616km Tokyo 8132km 5782km Jakarta 1845km 1303km London 9566km Helsinki 7815km 11550km 10838km New York 5567km

1) Write a "C" program that finds and prints all the paths (if exists) between the given two cities according to the graph below. This code also calculates and prints the minimum distance between the given two cities. Pay attention to the loops. 1264km Prague Beijing 4616km Tokyo 8132km 5782km Jakarta 1845km 1303km London 9566km Helsinki 7815km 11550km 10838km New York 5567km

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

1) Write a "C" program that finds and prints all the paths (if exists) between the given two cities according to the graph below. This code also calculates and prints the minimum distance between the given two cities. Pay attention to the loops. 1264km Prague 8132km Beijing Jakarta 4616km Tokyo London 1845km 1303km 5782km/ 9566km Helsinki 7815km 11550km 10838km New York 5567km Important: Your code should be properly commented. Uncommented code will get partial credit. You
5. Given # > 3 points P₁ = (x₁, y₁), …….‚ P₂ = (x₂‹ Yn) in the coordinate plane, design an algorithm to check whether all the points lie within a triangle with its vertices at three of the points given. (You can either design an algorithm from scratch or reduce the problem to another one with a known algorithm.)
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.
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.
PYTHON: In order to beat AlphaZero, Grandmaster Hikaru is improving her chess calculation skills.Today, Hikaru took a big chessboard with N rows (numbered 1 through N) and N columns (numbered 1 through N). Let's denote the square in row r and column c of the chessboard by (r,c). Hikaru wants to place some rooks on the chessboard in such a way that the following conditions are satisfied:• Each square of the board contains at most one rook.• There are no four rooks forming a rectangle. Formally, there should not be any four valid integers r1, c1, r2, c2 (≠r2,c1≠c2) such that there are rooks on squares (r1,c1), (r1,c2 (r2,c1)and (r2,c2).• The number of rooks is at least 8N.Help Hikaru find a possible distribution of rooks. If there are multiple solutions, you may find any one. It is guaranteed that under the given constraints, a solution always exists.InputThe first line of the input contains a single integer T denoting the number of test cases. The first and only line of each test case…
Exercise H for the Nested Loop Nested Loop Problems Write the program that would generate the multiplication table for numbers 1 to 10. For example: Result 1 2 3 4 5 6 7 8 9 10 2 4 6 8 10 12 14 16 18 20 3 6 9 12 15 18 21 24 27 30 4 8 12 16 20 24 28 32 36 40 5 10 15 20 25 30 35 40 45 50 6 12 18 24 30 36 42 48 54 60 7 14 21 28 35 42 49 56 63 70 8 16 24 32 40 48 56 64 72 80 9 18 27 36 45 54 63 72 81 90 10 20 30 40 50 60 70 80 90100
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…
Write a function that counts how many concentric layers a rug has. Examples countLayers([ "AAAA", "ABBA", "AAAA" ]) → 2 countLayers([ "AAAAAAAAA", "ABBBBBBBA", "ABBAAABBA", "ABBBBBBBA", "AAAAAAAAA" ]) →3 (Ctrl)
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
The Fibonacci sequence is a famous sequence in mathematics. The first element in the sequence is 0 and the second element is 1. The nth element is defined as Fn = Fn-1 + Fn-2- Implement the fib function, which takes an integer n and returns the n th Fibonacci number. Use a while loop in your solution. def fib(n): """Returns the nth Fibonacci number. >>> fib (0) 0 >>> fib (1) 1 >>> fib(2) 1 >>> fib(3) 2 >>> fib(4) 3 >>> fib(5) 5 >>> fib(6) 8 >>> fib (100) 354224848179261915075 "*** YOUR CODE HERE ***"
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
Our main objective is to implement breadth-first-search (BFS) to print the vertices of a graph G. To get the full grade, you must annotate your code (i.e., write relevant comments throughout your program) and proceed as follows: Ask the user to enter the number of nodes of a graph G. Ask the user to enter the edges of G (e.g., if the user enters 3 and 5; it means that there is an edge between nodes 3 and 5). Store the graph G using an adjacency matrix. Run BFS on G, starting form node 1 (i.e., we assume here that the start node is 1). Use a queue to implement BFS. You may use the queue class from the library of the programming language you are using (so there is no need to implement your own class queue). Write a main function to test your program, and make sure BFS is visiting the vertices of G as expected.