To solve the problem on Pascal(Columns)

Write a program which find the length of the shortest path from one vertex source to all other vertices of the graph using the method of breadth-first search. Use the graph layout in the form of adjacency matrix.