My Solutions Check bipartiteness of a graph Write a function that takes as input the adjacency matrix of a simple graph, and decides whether the graph is bipartite or not. You can use the function Find_edge_list() and Find_BFS_forest( ) provided by me that does exactly as it is described in the appropriate assignment. Instructions: • If the graph is not bipartite, the output should be an array containing the nodes of an odd-length cycle in order of visiting. • If the graph is bipartite, the output should be a 1xn array with only 0 and 1 entries, where the O entries correspond to nodes in one part and the 1 entries correspond to nodes in the other part. Example: if the graph has 6 nodes, and the edges are (12), (15), (23) then the graph is bipartite and a possible correct answer would be [010111], but there are other correct answers too (for example (010011] is also fine). If the edges are (12). (14), (16), (23), (35), (45) then the graph is not bipartite, and a possible correct answer would be [1235 4). as well as (3 21 4 5). however note that [1234 5] is not correct, because it contains the nodes in the wrong order. Also, [6 1235416] would be incorrect, because it is not a cycle.
My Solutions Check bipartiteness of a graph Write a function that takes as input the adjacency matrix of a simple graph, and decides whether the graph is bipartite or not. You can use the function Find_edge_list() and Find_BFS_forest( ) provided by me that does exactly as it is described in the appropriate assignment. Instructions: • If the graph is not bipartite, the output should be an array containing the nodes of an odd-length cycle in order of visiting. • If the graph is bipartite, the output should be a 1xn array with only 0 and 1 entries, where the O entries correspond to nodes in one part and the 1 entries correspond to nodes in the other part. Example: if the graph has 6 nodes, and the edges are (12), (15), (23) then the graph is bipartite and a possible correct answer would be [010111], but there are other correct answers too (for example (010011] is also fine). If the edges are (12). (14), (16), (23), (35), (45) then the graph is not bipartite, and a possible correct answer would be [1235 4). as well as (3 21 4 5). however note that [1234 5] is not correct, because it contains the nodes in the wrong order. Also, [6 1235416] would be incorrect, because it is not a cycle.
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
use MATLAB
![Check bipartiteness of a graph
My Solutions >
Write a function that takes as input the adjacency matrix of a simple graph, and decides whether the graph is bipartite or not. You can use the function Find_edge_list() and
Find_BFS_forest( provided by me that does exactiy as it is described in the appropriate assignment.
Instructions:
• If the graph is not bipartite, the output should be an array containing the nodes of an odd-length cycle in order of visiting.
• If the graph is bipartite, the output should be a 1xn array with only 0 and 1 entries, where the O entries correspond to nodes in one part and the 1 entries correspond to
nodes in the other part.
Example: if the graph has 6 nodes, and the edges are (12). (15). (23) then the graph is bipartite and a possible correct answer would be [010111], but there are other correct
answers too (for example [010011] is also fine). If the edges are (12). (14). (16), (23), (35), (45) then the graph is not bipartite, and a possible correct answer would be [1235 4).
as well as (3 214 5). however note that [1234 5) is not correct, because it contains the nodes in the wrong order. Also, (6 123 541 6) would be incorrect, because it is not a
cycle.
Function
H Save
C Reset
| MATLAB Documentation
1 function [ answer ] = Find bipartite( A)
2 % Decide whether the graph with adjacency matrix A is bipartite or not
4
s end](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fc0f3c766-8bc0-4fb2-810d-c53aa927df18%2Ff02fb97b-6cdc-412d-8f05-12d9f5f8a32e%2Fgicmtww_processed.png&w=3840&q=75)
Transcribed Image Text:Check bipartiteness of a graph
My Solutions >
Write a function that takes as input the adjacency matrix of a simple graph, and decides whether the graph is bipartite or not. You can use the function Find_edge_list() and
Find_BFS_forest( provided by me that does exactiy as it is described in the appropriate assignment.
Instructions:
• If the graph is not bipartite, the output should be an array containing the nodes of an odd-length cycle in order of visiting.
• If the graph is bipartite, the output should be a 1xn array with only 0 and 1 entries, where the O entries correspond to nodes in one part and the 1 entries correspond to
nodes in the other part.
Example: if the graph has 6 nodes, and the edges are (12). (15). (23) then the graph is bipartite and a possible correct answer would be [010111], but there are other correct
answers too (for example [010011] is also fine). If the edges are (12). (14). (16), (23), (35), (45) then the graph is not bipartite, and a possible correct answer would be [1235 4).
as well as (3 214 5). however note that [1234 5) is not correct, because it contains the nodes in the wrong order. Also, (6 123 541 6) would be incorrect, because it is not a
cycle.
Function
H Save
C Reset
| MATLAB Documentation
1 function [ answer ] = Find bipartite( A)
2 % Decide whether the graph with adjacency matrix A is bipartite or not
4
s end
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 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