Question: The girth of a graph is the length of its shortest cycle. If a graph is acyclic, then its girth is infinite. Give the pseudocode for the method girth(), which when given a graph G = (V, E) returns the girth of the graph.    Hint : Run BFS from each vertex. The shortest cycle containing s is the shortest path from s to some vertex v, plus the edge from v back to s.    * You may directly use methods discussed in class in your code (for example BFS, DFS, Topological Sort etc); that is, there is no need to give the code for these methods.

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
icon
Related questions
Question

please use pseudocode thank you!

 

Question: The girth of a graph is the length of its shortest cycle. If a graph is acyclic, then its girth is infinite. Give the pseudocode for the method girth(), which when given a graph G = (V, E) returns the girth of the graph. 

 

Hint : Run BFS from each vertex. The shortest cycle containing s is the shortest path from s to some vertex v, plus the edge from v back to s. 

 

* You may directly use methods discussed in class in your code (for example BFS, DFS, Topological Sort etc); that is, there is no need to give the code for these methods.

Expert Solution
steps

Step by step

Solved in 2 steps with 3 images

Blurred answer
Knowledge Booster
Polynomial time
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.
Similar questions
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