Implementation of Graph in C++ using list
12345678910111213141516171819202122232425262728293031323334353637383940414243444546
#include <iostream>
#include <vector>
#include<list>
using namespace std;
class Graph {
int V;
list<pair<int,int>> *l;
int weight;
public:
Graph(int V){
this->V = V;
l = new list<pair<int,int>>[V];
}
void addEdge(int x , int y , int weight){
l[x].push_back(make_pair(y , weight));
l[y].push_back(make_pair(x , weight));
}
void print(){
for(int i=0 ; i<V ; i++){
for(auto it = l[i].begin() ; it!= l[i].end(); it++){
cout<<i<<"->"<<it->first<<"("<<"Weight: "<<it->second<<")"<<endl;
}
}
}
};
int main() {
Graph g(4);
g.addEdge(0,1 , 10);
g.addEdge(0,2, 20);
g.addEdge(1,2, 21);
g.print();
return 0;
}
Cpp
INFO