#include#include using namespace std; int main() { int n = 5; vector adj[n+1]; adj[1].push_back(2); adj[2].push_back(1); adj[1].push_back(3); adj[3].push_back(1); adj[2].push_back(3); adj[3].push_back(2); adj[2].push_back(4); adj[4].push_back(2); adj[3].push_back(4); adj[4].push_back(3); adj[4].push_back(5); adj[5].push_back(4); cout << "Adjacency List:" << endl; for(int i=1; i<=n; i++) { cout << i << ":"; for(int j=0; j " << adj[i][j]; } cout << endl; } return 0; }
Adjacency List: 1: -> 2 -> 3 2: -> 1 -> 3 -> 4 3: -> 1 -> 2 -> 4 4: -> 2 -> 3 -> 5 5: -> 4
#include#include #include using namespace std; int main() { int n = 5; vector > edges; edges.push_back(make_pair(1, 2)); edges.push_back(make_pair(1, 3)); edges.push_back(make_pair(2, 3)); edges.push_back(make_pair(2, 4)); edges.push_back(make_pair(3, 4)); edges.push_back(make_pair(4, 5)); cout << "Edges:" << endl; for(int i=0; i " << edges[i].second << endl; } return 0; }
Edges: 1 -> 2 1 -> 3 2 -> 3 2 -> 4 3 -> 4 4 -> 5In this example, we create an undirected graph with 5 vertices (1, 2, 3, 4, 5) using an edge list. We add edges between vertices using addEdge function. The code examples above do not utilize package libraries.