Output For each graph, produce a line listing the weak vertices ordered from least to greatest. Sample Input 1 9 0 1 1 1 0 0 0 0 0 100000100 1 0 0 1 0 1 0 0 0 1 0 1 0 0 1 1 0 0 0 0 0 0 0 0 1 1 0 001100000 0 1 0 1 1 0 0 1 0 1 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 10 1 0 -1 Sample Output 1 18 0
Output For each graph, produce a line listing the weak vertices ordered from least to greatest. Sample Input 1 9 0 1 1 1 0 0 0 0 0 100000100 1 0 0 1 0 1 0 0 0 1 0 1 0 0 1 1 0 0 0 0 0 0 0 0 1 1 0 001100000 0 1 0 1 1 0 0 1 0 1 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 10 1 0 -1 Sample Output 1 18 0
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
Related questions
Question
Code in Java Thank You.
Engineers like to use triangles. It probably has something to do with how a triangle can provide a lot of structural strength.

Transcribed Image Text:Output
For each graph, produce a line listing the weak vertices ordered from least to
greatest.
Sample Input 1
9
0 1 1 1 0 0 0 0 0
1 0 0 0 0 0 1 0 0
1 0 0 1 0 1 0 0 0
1 0 1 0 0 1 1 0 0
0 0 0 0 0 0 1 1 0
000000110
0 0 1 1 0 0 0 0 0
0 1 0 1 1 0 0 1 0
0 0 0 0 1 0 1 0 1
0 0 0 0 0 0 0 1 0
1
0
-1
Sample Output 1
18
0
↓

Transcribed Image Text:Problem A
Weak Vertices
<Hide
Engineers like to use triangles. It probably has something to do with how a
triangle can provide a lot of structural strength. We can describe the physical
structure of some designs using an undirected graph. We'll say vertex i is part of a
triangle if i has two different neighbors j and k such that j and k are neighbors of
each other. For this problem, find weak vertices in graphs - those vertices that is
not part of any triangle.
A
Figure 1: An illustration of the weak vertices (which are shaded) from the sample input graph.
Input
Input consists of up to 100 graphs. Each starts with an integer, 1 ≤ n ≤ 20,
giving the number of vertices in the graph. Next come n lines with n integers on
each line, which describe an n x n adjacency matrix for the graph. Vertices are
numbered from 0 to n - 1. If the adjacency matrix contains a one at row r,
column c (where 0 ≤r, c≤ n − 1), it means that there is an edge from vertex r
to vertex c. Since the graph is undirected, the adjacency matrix is symmetric. The
end of input is marked by a value of -1 for n.
Expert Solution

This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps with 2 images

Knowledge Booster
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
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education

Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON

Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON

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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON

Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON

C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON

Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning

Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education