No of Connected Components

PHOTO

Mon Jan 10 2022 06:50:46 GMT+0000 (Coordinated Universal Time)

Saved by @vaibhav_55

//Aplication of DFS traversal is to find if the graph is connected or not below is the implementation of it
          int no_of_connected_components = 0;
          for (int i = 1; i <= nodes; i++)
          {
              if (visited[i] == false)
              {
                  dfs(i);
                  no_of_connected_components++;
              }
          }
          //above dfs function is same as previous algo's dfs

Save snippets that work from anywhere online with our extensions

Available in the Chrome Web Store

Get Firefox Add-on

Get VS Code extension

Comments

More like this

Graphs

@vaibhav_55

Dfs No of Connected Components Single source shortest path (on trees) Bipartite Graph test cycle detection in undirected graph Cycle detection in directed graph In-Out time of nodes Diameter of Tree Calculating the sizeof subtree in O(n) Bfs single shortest path using bfs Articulation point 🚩🚩🚩 Bridges in graph 🚩🚩🚩 Topological Sort 🚩🚩🚩 Shortest Path in DAG🚩🚩 Dijkstra Algorithm (single source shortest path)🚩🚩 Primes Algo for MST🚩🚩 Disjoint Set Union🚩🚩🚩 Kruskal's Algorithm for MST 🚩🚩🚩

Browse more snippets >>