GRAF

#include <iostream>
#include <vector>
#define MAXN 1000
using namespace std;


int main()
{
    std::vector<int>edge[MAXN+1];
    int m,n,a,b;
    int father[MAXN+1];
    bool visit[MAXN+1];
    std::cin>>m>>n;
    for(int i = 1; i <= n; i++)
    {
        std::cin>>a>>b;
        edge[a].push_back(b);
        edge[b].push_back(a);
    }
    //DFS,BFS
    cout << "Lista sasiedztwa\n";
    for(int i =1 ; i <= m ; i++)
    {
        for(int j = 0; j < edge[i].size() ; j++)
        {
            cout << edge[i][j] << ",";
        }
        cout << "\n";
    }


    return 0;
}