Graph Implementation
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556
#include <iostream>
#include <list>
using namespace std;
class Edge {
public:
int y;
int weight;
Edge(int y, int weight){
this->y = y;
this->weight = weight;
}
};
class Graph{
public:
int V;
list<Edge> *l;
Graph(int V){
this->V = V;
l = new list<Edge>[V];
}
void addEdge(int x ,int y, int weight){
Edge v(y, weight);
l[x].push_back(v);
Edge v2(x,weight);
l[y].push_back(v2);
}
void print() {
for(int i=0; i<V; i++){
for(auto x: l[i]){
cout<<i<<"-->"<<x.y<<" Weight: "<<x.weight<<endl;
}
}
}
};
int main() {
Graph g(3);
g.addEdge(0,1,10);
g.addEdge(0,2,20);
g.addEdge(1,2,21);
g.print();
}
Cpp
INFO