Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
graph representation Adjacency List
//g++ 7.4.0 #include<bits/stdc++.h> using namespace std; const int N = 100000; //vector<int> adj[N]; map<int , vector<int>> adj; bool bidir = true; void addEdge(int x , int y) { adj[x].push_back(y); if(bidir) adj[y].push_back(x); } void printGraph(int v) { for(int i=1 ; i<=v ;i++) { cout<<"node "<<i<<" "; for(int x : adj[i]) cout<<x<<" "; cout<<endl; } } int main() { int v,e; cin>>v>>e; //create graph in adj list for(int i=0 ;i<e ;i++) { int x,y; cin>>x>>y; addEdge(x,y); } //print graph in adj list printGraph(v); return 0; }
run
|
edit
|
history
|
help
0
Breakfast Function
Shared lock
Conjuntos - Comparar cantidad de elementos únicos en 2 vectores
macros
Programa 3 (corregido)
bitmap with pairs
gp series
abbinsertbool
Stream3
doubly