## Sum of degrees of all nodes of a undirected graph

Given an edge list of a graph we have to find the sum of degree of all nodes of a undirected graph. Example Examples: Input… Read More »

Given an edge list of a graph we have to find the sum of degree of all nodes of a undirected graph. Example Examples: Input… Read More »

Given an array arr[] of size N consisting of distinct integers from range [0, N – 1] arranged in a random order. Also given a… Read More »

Given a graph with N nodes and M edges. The task is to find the number of ways to select a node from each connected… Read More »

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 »