Submission

Score: 100

User: navysrimuang

Problemset: เก็บกราฟเบื้องต้น

Language: cpp

Time: 0.063 second

Submitted On: 2025-10-31 21:20:10

#include<vector>
#include<utility>
#include "adjacency_list.h"
#define endl '\n'
using namespace std;

// edge list to adj list


vector<vector<int>> createGraph(int N,vector<pair<int,int>>E){

  vector<vector<int>>adj(N);
  for(auto i:E){
    adj[i.first].push_back(i.second);
    adj[i.second].push_back(i.first);
  }

  return adj;
}