Find the Girth of an Undirected Graph
Description:
In this project, we will process an undirected graph, notnecessarily connected. The
girth of a graph is the length of a shortest cycle in this graph.After you nd the girth,
you also need to produce the cycle that corresponds to thegirth.
Requirements:
1. (Input) The input comes from a text le that stores the adjacencymatrix of a
graph. Your program will take the le name of an input as acommand-line argu-
ment. Then your program will read the content of the le line byline, in which
each row corresponds to one row of the adjacency matrix of agraph.
2. (Validation) Before we
OR
OR