This program reads an input file that contains a graph and i need to make this do either a dfs or bfs of the graph and print out the resuult in form of an adjency matrix.

#include #include #include

using namespace std;

int main() { int n, i, j; int A[100][100];

ifstream input; input.open("graph25.txt"); input >> n; for (i=0;i> A[i][j]; } } input.close();

for(i=0;i

cin >> i; }