ALGORITHM

Need to implement a BFS in JAVA. Program should take as input a graph adjacency matrix as in DFS, and generate the following:

Order in which vertices are first encountered. Assume that the vertices are visited in numerical order when no other order is specified by the search. The number of connected components in the graph. . Tree edges. . Cross edges. For the graph in Figure 1, the program should generate the following vertex ordering (count value for vertices): The number of connected components is 1. The tree edges and cross edges are given by two adjacency matrices: Tree edges 0 0 0 000 1 0 0 00 1 0 0 0 0 Cross edges 0001 000 0