## Minimum operations of the given type required to make a complete graph

Given N vertex where N is even. Initially there is no edge between any of the vertices. You are allowed to perform operation as illustrated… Read More »

- Maximum number of edges among all connected components of an undirected graph
- Number of Walks from source to destination
- Minimum operations of the given type required to make a complete graph
- Finding in and out degrees of all vertices in a graph
- All vertex pairs connected with exactly k edges in a graph
- Check if the given graph represents a Star Topology
- Maximize number of nodes which are not part of any edge in a Graph
- Check if the given graph represents a Ring Topology
- Check if the given graph represents a Bus Topology

Given N vertex where N is even. Initially there is no edge between any of the vertices. You are allowed to perform operation as illustrated… Read More »

Given a directed graph, the task is to count the in and out degree of each vertex of the graph. Examples: Input: Output: Vertex In… Read More »

Given a graph G, the task is to check if it represents a Star Topology. A Star Topology is the one shown in the image… Read More »

Given a graph G, the task is to check if it represents a Ring Topology. A Ring Topology is the one shown in the image… Read More »

Given a graph G, check if it represents a Bus Topology. A Bus Topology is the one shown in the image below: Examples: Input: Output:… Read More »

Given integers ‘N’ and ‘K’ where, N is the number of vertices of an undirected graph and ‘K’ denotes the number of edges in the… Read More »

Given a graph and two vertices src and dest, count the total number of paths from src to dest where the length of the path… Read More »

Given a directed graph represented as an adjacency matrix and an integer ‘k’, the task is to find all the vertex pairs that are connected… Read More »

Given a graph with n nodes and m edges. Find the maximum possible number of nodes which are not part of any edge (m will… Read More »

Given an undirected graph, how to check if there is a cycle in the graph? For example, the following graph has a cycle 1-0-2-1. Recommended:… Read More »

Given a set of ‘n’ vertices and ‘m’ edges of an undirected simple graph (no parallel edges and no self-loop), find the number of single-cycle-components… Read More »

Given an unweighted directed graph, can be cyclic or acyclic. Print the number of shortest paths from a given vertex to each of the vertices.… Read More »

Given an adjacency matrix representation of an undirected graph. Find if there is any Eulerian Path in the graph. If there is no path print… Read More »

Given an undirected graph and a set of vertices, we have to count the number of non reachable nodes from the given head node using… Read More »

Given a array arr[] of n integers. For every value arr[i], we can move to arr[i] + 1 clockwise considering array elements in cycle. We… Read More »