Graph implementation using STL for competitive programming | Set 1 (DFS of Unweighted and Undirected)

06 Jul, 2022
We have introduced Graph basics in Graph and its representations. 
In this post, a different STL-based representation is used that can be helpful to quickly implement graphs using vectors. The implementation is for the adjacency list representation of the graph. 
Following is an example undirected and unweighted graph with 5 vertices.  
Below is an adjacency list representation of the graph.  
We use vectors in STL to implement graphs using adjacency list representation. 
vector: A sequence container. Here we use it to store adjacency lists of all vertices. We use vertex numbers as the index in this vector.
The idea is to represent a graph as an array of vectors such that every vector represents the adjacency list of a vertex. Below is a complete STL-based C++ program for DFS Traversal. 
Implementation:
C++
Python3
Javascript
// A simple representation of graph using STL,// for the purpose of competitive programming#include<bits/stdc++.h>using namespace std; // A utility function to add an edge in an// undirected graph.void addEdge(vector<int> adj[], int u, int v){    adj[u].push_back(v);    adj[v].push_back(u);} // A utility function to do DFS of graph// recursively from a given vertex u.void DFSUtil(int u, vector<int> adj[],                    vector<bool> &visited){    visited[u] = true;    cout << u << " ";    for (int i=0; i<adj[u].size(); i++)        if (visited[adj[u][i]] == false)            DFSUtil(adj[u][i], adj, visited);} // This function does DFSUtil() for all// unvisited vertices.void DFS(vector<int> adj[], int V){    vector<bool> visited(V, false);    for (int u=0; u<V; u++)        if (visited[u] == false)            DFSUtil(u, adj, visited);} // Driver codeint main(){    int V = 5;     // The below line may not work on all    // compilers.  If it does not work on    // your compiler, please replace it with    // following    // vector<int> *adj = new vector<int>[V];    vector<int> adj[V];     // Vertex numbers should be from 0 to 4.    addEdge(adj, 0, 1);    addEdge(adj, 0, 4);    addEdge(adj, 1, 2);    addEdge(adj, 1, 3);    addEdge(adj, 1, 4);    addEdge(adj, 2, 3);    addEdge(adj, 3, 4);    DFS(adj, V);    return 0;}
# A simple representation of graph using STL,# for the purpose of competitive programming # A utility function to add an edge in an# undirected graph.def addEdge(adj, u, v):    adj[u].append(v)    adj[v].append(u)    return adj # A utility function to do DFS of graph# recursively from a given vertex u.def DFSUtil(u, adj, visited):    visited[u] = True    print(u, end = " ")    for i in range(len(adj[u])):        if (visited[adj[u][i]] == False):            DFSUtil(adj[u][i], adj, visited) # This function does DFSUtil() for all# unvisited vertices.def DFS(adj, V):    visited = [False]*(V+1)     for u in range(V):        if (visited[u] == False):            DFSUtil(u, adj, visited) # Driver codeif __name__ == '__main__':    V = 5     # The below line may not work on all    # compilers.  If it does not work on    # your compiler, please replace it with    # following    # vector<int> *adj = new vector<int>[V]    adj = [[] for i in range(V)]     # Vertex numbers should be from 0 to 4.    adj = addEdge(adj, 0, 1)    adj = addEdge(adj, 0, 4)    adj = addEdge(adj, 1, 2)    adj = addEdge(adj, 1, 3)    adj = addEdge(adj, 1, 4)    adj = addEdge(adj, 2, 3)    adj = addEdge(adj, 3, 4)    DFS(adj, V) # This code is contributed by mohit kumar 29.
<script>// A simple representation of graph using STL,// for the purpose of competitive programming              // A utility function to add an edge in an// undirected graph.    function addEdge(adj,u,v)    {        adj[u].push(v);        adj[v].push(u);    }         // A utility function to do DFS of graph// recursively from a given vertex u.    function DFSUtil(u,adj,visited)    {        visited[u] = true;        document.write(u+" ");    for (let i=0; i<adj[u].length; i++)        if (visited[adj[u][i]] == false)            DFSUtil(adj[u][i], adj, visited);    }         // This function does DFSUtil() for all// unvisited vertices.    function DFS(adj,V)    {        let visited=new Array(V);        for(let i=0;i<V;i++)        {            visited[i]=false;        }    for (let u=0; u<V; u++)        if (visited[u] == false)            DFSUtil(u, adj, visited);    }         // Driver code    let V = 5;         // The below line may not work on all    // compilers.  If it does not work on    // your compiler, please replace it with    // following    // vector<int> *adj = new vector<int>[V];    let adj=new Array(V);    for(let i=0;i<V;i++)    {        adj[i]=[];    }         // Vertex numbers should be from 0 to 4.    addEdge(adj, 0, 1);    addEdge(adj, 0, 4);    addEdge(adj, 1, 2);    addEdge(adj, 1, 3);    addEdge(adj, 1, 4);    addEdge(adj, 2, 3);    addEdge(adj, 3, 4);    DFS(adj, V);                   // This code is contributed by unknown2108</script>
0 1 2 3 4 
Below are related articles: Graph implementation using STL for competitive programming | Set 2 (Weighted graph) Dijkstra’s Shortest Path Algorithm using priority_queue of STL Dijkstra’s shortest path algorithm using set in STL Kruskal’s Minimum Spanning Tree using STL in C++ Prim’s algorithm using priority_queue in STL
This article is contributed by Shubham Gupta. If you like GeeksforGeeks and would like to contribute, you can also write an article and mail your article to review-team@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks. 
Akanksha_Rai
mohit kumar 29
unknown2108
hardikkoriintern
STL
Competitive Programming
Graph
Graph
STL
Writing code in comment?
Please use ide.geeksforgeeks.org,
generate link and share the link here.