# Graph implementation using STL for competitive programming | Set 2 (Weighted graph)

In Set 1, unweighted graph is discussed. In this post, weighted graph representation using STL is discussed. The implementation is for adjacency list representation of weighted graph.

We use two STL containers to represent graph:

- vector : A sequence container. Here we use it to store adjacency lists of all vertices. We use vertex number as index in this vector.
- pair : A simple container to store pair of elements. Here we use it to store adjacent vertex number and weight of edge connecting to the adjacent.

The idea is to use a vector of pair vectors. Below code implements the same.

`// C++ program to represent undirected and weighted graph ` `// using STL. The program basically prints adjacency list ` `// representation of graph ` `#include <bits/stdc++.h> ` `using` `namespace` `std; ` ` ` `// To add an edge ` `void` `addEdge(vector <pair<` `int` `, ` `int` `> > adj[], ` `int` `u, ` ` ` `int` `v, ` `int` `wt) ` `{ ` ` ` `adj[u].push_back(make_pair(v, wt)); ` ` ` `adj[v].push_back(make_pair(u, wt)); ` `} ` ` ` `// Print adjacency list representaion ot graph ` `void` `printGraph(vector<pair<` `int` `,` `int` `> > adj[], ` `int` `V) ` `{ ` ` ` `int` `v, w; ` ` ` `for` `(` `int` `u = 0; u < V; u++) ` ` ` `{ ` ` ` `cout << ` `"Node "` `<< u << ` `" makes an edge with \n"` `; ` ` ` `for` `(` `auto` `it = adj[u].begin(); it!=adj[u].end(); it++) ` ` ` `{ ` ` ` `v = it->first; ` ` ` `w = it->second; ` ` ` `cout << ` `"\tNode "` `<< v << ` `" with edge weight ="` ` ` `<< w << ` `"\n"` `; ` ` ` `} ` ` ` `cout << ` `"\n"` `; ` ` ` `} ` `} ` ` ` `// Driver code ` `int` `main() ` `{ ` ` ` `int` `V = 5; ` ` ` `vector<pair<` `int` `, ` `int` `> > adj[V]; ` ` ` `addEdge(adj, 0, 1, 10); ` ` ` `addEdge(adj, 0, 4, 20); ` ` ` `addEdge(adj, 1, 2, 30); ` ` ` `addEdge(adj, 1, 3, 40); ` ` ` `addEdge(adj, 1, 4, 50); ` ` ` `addEdge(adj, 2, 3, 60); ` ` ` `addEdge(adj, 3, 4, 70); ` ` ` `printGraph(adj, V); ` ` ` `return` `0; ` `} ` |

*chevron_right*

*filter_none*

Output:

Node 0 makes an edge with Node 1 with edge weight =10 Node 4 with edge weight =20 Node 1 makes an edge with Node 0 with edge weight =10 Node 2 with edge weight =30 Node 3 with edge weight =40 Node 4 with edge weight =50 Node 2 makes an edge with Node 1 with edge weight =30 Node 3 with edge weight =60 Node 3 makes an edge with Node 1 with edge weight =40 Node 2 with edge weight =60 Node 4 with edge weight =70 Node 4 makes an edge with Node 0 with edge weight =20 Node 1 with edge weight =50 Node 3 with edge weight =70

This article is contributed by **Sahil Chhabra (akku)**. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

## Recommended Posts:

- Graph implementation using STL for competitive programming | Set 1 (DFS of Unweighted and Undirected)
- Prefix Sum Array - Implementation and Applications in Competitive Programming
- Shortest Path in a weighted Graph where weight of an edge is 1 or 2
- Shortest path with exactly k edges in a directed and weighted graph
- Implementation of Graph in JavaScript
- Convert the undirected graph into directed graph such that there is no path of length greater than 1
- Detect cycle in the graph using degrees of nodes of graph
- Tips and Tricks for Competitive Programmers | Set 2 (Language to be used for Competitive Programming)
- Longest path in a directed Acyclic graph | Dynamic Programming
- How can competitive programming help you get a job?
- Fast I/O for Competitive Programming
- A Better Way To Approach Competitive Programming
- Python in Competitive Programming
- Bit Tricks for Competitive Programming
- How to become a master in competitive programming?