Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
Task 01 (Graph Representation) : A) You are given a directed weighted Graph, G. The graph consists of N vertices and M edges. In this problem, you have to store the graph using Adjacency Matrix and print the matrix. Input: The first line contains two integers N and M (1 <= N, M <= 100) - the number of vertices and the total number of edges. The next M lines will contain three integers u₁, V₁, and w₁ (1 <= U₁ V₁ <= N, 1 <= W₁ <= 1000) denoting there is an edge between node u₁ and v₁ with cost W₁. Output: You have to make the graph using Adjacency Matrix, and print the Adjacency Matrix in output. Sample Input/Output: Sample Input 1 43 138 325 142 Sample Input 2 67 156 635 139 347 4 6 1 568 616 Sample Output 1 ооооо 00082 ооооо 00500 ооооо Sample Output 2 ооооооо 0009060 ооооооо 0000700 000000 1 оооооо 8 0605000

Task 01 (Graph Representation) : A) You are given a directed weighted Graph, G. The graph consists of N vertices and M edges. In this problem, you have to store the graph using Adjacency Matrix and print the matrix. Input: The first line contains two integers N and M (1 <= N, M <= 100) - the number of vertices and the total number of edges. The next M lines will contain three integers u₁, V₁, and w₁ (1 <= U₁ V₁ <= N, 1 <= W₁ <= 1000) denoting there is an edge between node u₁ and v₁ with cost W₁. Output: You have to make the graph using Adjacency Matrix, and print the Adjacency Matrix in output. Sample Input/Output: Sample Input 1 43 138 325 142 Sample Input 2 67 156 635 139 347 4 6 1 568 616 Sample Output 1 ооооо 00082 ооооо 00500 ооооо Sample Output 2 ооооооо 0009060 ооооооо 0000700 000000 1 оооооо 8 0605000

Database System Concepts
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
icon
Related questions
Question
Please use python and python file i/o to solve the problem. Create an input file input1a_2.txt as shown below, solve the problem and print the output to output1a_2.txt file as shown in the question.
Task 01 (Graph Representation) : A) You are given a directed weighted Graph, G. The graph consists of N vertices and M edges. In this problem, you have to store the graph using Adjacency Matrix and print the matrix. Input: The first line contains two integers N and M (1 <= N, M <= 100) - the number of vertices and the total number of edges. The next M lines will contain three integers u₁, V₁, and w₁ (1 <= U₁ V₁ <= N, 1 <= W₁ <= 1000) denoting there is an edge between node u₁ and v₁ with cost w₁. Output: You have to make the graph using Adjacency Matrix, and print the Adjacency Matrix in output. Sample Input/Output: Sample Input 1 43 1 3 8 325 1 4 2 Sample Input 2 6 7 1 5 6 635 1 3 9 3 4 7 461 568 616 Sample Output 1 ооооо 00082 ооооо 0 0 5 0 0 00000 Sample Output 2 ооооооо 0009060 ооооооо 0 000 70 0 0 0 0 0 0 0 1 ооооо 0 8 06 05 000
Transcribed Image Text:Task 01 (Graph Representation) : A) You are given a directed weighted Graph, G. The graph consists of N vertices and M edges. In this problem, you have to store the graph using Adjacency Matrix and print the matrix. Input: The first line contains two integers N and M (1 <= N, M <= 100) - the number of vertices and the total number of edges. The next M lines will contain three integers u₁, V₁, and w₁ (1 <= U₁ V₁ <= N, 1 <= W₁ <= 1000) denoting there is an edge between node u₁ and v₁ with cost w₁. Output: You have to make the graph using Adjacency Matrix, and print the Adjacency Matrix in output. Sample Input/Output: Sample Input 1 43 1 3 8 325 1 4 2 Sample Input 2 6 7 1 5 6 635 1 3 9 3 4 7 461 568 616 Sample Output 1 ооооо 00082 ооооо 0 0 5 0 0 00000 Sample Output 2 ооооооо 0009060 ооооооо 0 000 70 0 0 0 0 0 0 0 1 ооооо 0 8 06 05 000
x 67 156 635 3 9 47 6 1 568 6 1 6 1 3 4 input1a_2.txt
Transcribed Image Text:x 67 156 635 3 9 47 6 1 568 6 1 6 1 3 4 input1a_2.txt
Expert Solution
steps

Step by step

Solved in 4 steps with 5 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Program on Numbers
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS