graph-connectivity

50+ posts

Similar Topics

DSA

20.6k+ articles

Mathematical

7.6k+ articles

Competitive Programming

1.4k+ articles

820+ articles

820+ articles

340+ articles

200+ articles

50+ articles

40+ articles

30+ articles

Cycles of length n in an undirected and connected graph

Last updated: 27 January 2023

Given an undirected and connected graph and a number n, count total number of cycles of length n in the graph. A cycle of length n simply means that the cycle contains n v...read more

Mathematics | Graph Isomorphisms and Connectivity

Last updated: 28 February 2023

Isomorphism : Consider the following two graphs - Are the graphs[Tex]G[/Tex]and[Tex]G^{\prime}[/Tex]the same? If your answer is no, then you need to rethink it. The graph...read more

graph-connectivity

GATE CS

Engineering Mathematics

Discrete Mathematics

Find all reachable nodes from every node present in a given set

Last updated: 10 March 2023

Given an undirected graph and a set of vertices, find all reachable nodes from every vertex present in the given set.Consider below undirected graph with 2 disconnected co...read more

Find a Mother Vertex in a Graph

Last updated: 22 September 2022

Write a function to find a mother vertex in the graph.What is a Mother Vertex?A mother vertex in a graph G = (V, E) is a vertex v such that all other vertices in G can be ...read more

Connected Components in an Undirected Graph

Last updated: 07 March 2023

Given an undirected graph, the task is to print all the connected components line by line.Examples:Input: Consider the following graph Output:0 1 23 4Explanation: There ar...read more

Tarjan's Algorithm to find Strongly Connected Components

Last updated: 06 June 2023

A directed graph is strongly connected if there is a path between all pairs of vertices. A strongly connected component (SCC) of a directed graph is a maximal strongly con...read more

Graph

graph-connectivity

DSA

Euler Circuit in a Directed Graph

Last updated: 31 January 2023

Eulerian Path is a path in graph that visits every edge exactly once. Eulerian Circuit is an Eulerian Path which starts and ends on the same vertex.A graph is said to be e...read more

Check if a graph is strongly connected | Set 1 (Kosaraju using DFS)

Last updated: 27 January 2023

Given a directed graph, find out whether the graph is strongly connected or not. A directed graph is strongly connected if there is a path between any two pair of vertices...read more

Last updated: 02 May 2023

Given an undirected Graph, The task is to find the Bridges in this Graph.An edge in an undirected connected graph is a bridge if removing it disconnects the graph. For a d...read more

Graph

graph-connectivity

DSA

Articulation Points (or Cut Vertices) in a Graph

Last updated: 20 September 2023

A vertex v is an articulation point (also called cut vertex) if removing v increases the number of connected components.Articulation points represent vulnerabilities in a ...read more

Strongly Connected Components

Last updated: 20 September 2023

A strongly connected component is the component of a directed graph that has a path from every vertex to every other vertex in that component. It can only be used in a dir...read more

Find the number of islands using DFS

Last updated: 01 August 2023

Given a binary 2D matrix, find the number of islands. A group of connected 1s forms an island. For example, the below matrix contains 4 islands.Example:Input: mat[][] = {{...read more

Streamoid Technologies

1 2 3 4 5 >>

1 2 3 4 5 >>

1 2 3 4 >>