1. BFS: shortest distance from the source on each vertex once the algorithm completedInput: take an input graph in the form of adjacency matrix.0 1 0 0 1 0 0 01 0 0 0 0 1 0 00 0 0 1 0 1 1 00 0 1 0 0 0 1 11 0 0 0 0 0 0 00 1 1 0 0 0 1 00 0 1 1 0 1 0 10 0 0 1 0 0 1 0Output: an adjacency matrix of a shortest path tree and each coordinate along diagonalshould contain the distance from the source to
OR
OR