Help code in c++

In this assignment you will read an adjacency list from a file using linux redirection into an Adjacency Matrix (Stored as a 2-Dimensional Array could be booleans but might as well make them integers so you can re-use this code in future assignments where weights matter) and then print the output of the Breadth First Search Algorithm for each Node. You must use a queue in your implementation of the Breadth First Algorithm. Expect the graphs to be undirected, unweighted graph with, or without, cycles. Notes: -Comment your source code appropriately. Make sure you name your program file in accordance with the syllabus stipulations Test your program by running with different input to make sure the output is correct. To improve efficiency, expect the matrix size to be a maximum of 100 nodes. That way you can use a static array -For situations where you have to pick between multiple nodes. Choose the smaller values first. Test and execute your program by using data-in by Linux input redirection. If your executable code is Ast# and your data file is named data# execute as: Ast-c data# Sample Input: 1: 2 9 3: 45 6 9 5: 3 8 6: 3 7 7:689 8: 5 7 9: 1 3 7