Similar Topics

DSA

21k+ articles

Tree

1.3k+ articles

Algorithms

1.2k+ articles

Graph

850+ articles

Data Structures

800+ articles

DFS

350+ articles

Data Structures

230+ articles

priority-queue

110+ articles

Graph Traversals

40+ articles

Algorithms-Graph Traversals

30+ articles

Data Structures-Graph

30+ posts

Popular articles

Recent articles

Pendant Vertices, Non-Pendant Vertices, Pendant Edges and Non-Pendant Edges in Graph

Last Updated: 31 January 2023

Pre-requisites: Handshaking theorem.Pendant VerticesLet G be a graph, A vertex v of G is called a pendant vertex if and only if v has degree 1. In other words, pendant ver...read more

Data Structures-Graph

Print Adjacency List for a Directed Graph

Last Updated: 18 January 2023

An Adjacency List is used for representing graphs. Here, for every vertex in the graph, we have a list of all the other vertices which the particular vertex has an edge to...read more

Data Structures

Data Structures-Graph

Minimum time taken by each job to be completed given by a Directed Acyclic Graph

Last Updated: 06 February 2023

Given a Directed Acyclic Graph having V vertices and E edges, where each edge {U, V} represents the Jobs U and V such that Job V can only be started only after completion ...read more

Topological Sorting

Data Structures-Graph

Algorithms-Graph Traversals

Graph Traversals

Similar Topics

DSA

21k+ articles

Tree

1.3k+ articles

Algorithms

1.2k+ articles

Graph

850+ articles

Data Structures

800+ articles

DFS

350+ articles

Data Structures

230+ articles

priority-queue

110+ articles

Graph Traversals

40+ articles

Algorithms-Graph Traversals

30+ articles

Minimum Cost using Dijkstra by Modifying Cost of an Edge

Last Updated: 27 March 2023

Given an undirected weighted graph of N nodes and M edges in the form of a tuple lets say {X, Y, Z} such that there is an edge with cost Z between X and Y. We are supposed...read more

Data Structures-Graph

Algorithms-Graph Traversals

cpp-priority-queue

Real-life Applications of Data Structures and Algorithms (DSA)

Last Updated: 19 October 2023

You may have heard that DSA is primarily used in the field of computer science. Although DSA is most commonly used in the computing field, its application is not restricte ...read more

Data Structures

Data Structures

Data Structures-Binary Trees

Data Structures-Tree Traversals

Data Structures-Linked List

Data Structures-Stack

Data Structures-Queue

Data Structures-Graph

Data Structures-Balanced Binary Search Trees

Data Structures-Hash

Data Structures-Array

Data Structures-Misc

Data Structures-B and B+ Trees

Data Structures-Heap

Some Basic Theorems on Trees

Last Updated: 06 March 2023

Tree:- A connected graph without any circuit is called a Tree. In other words, a tree is an undirected graph G that satisfies any of the following equivalent conditions: ...read more

Advanced Data Structure

Data Structures-Graph

Basic Properties of a Graph

Last Updated: 15 March 2023

A Graph is a non-linear data structure consisting of nodes and edges. The nodes are sometimes also referred to as vertices and the edges are lines or arcs that connect any...read more

Data Structures-Graph

Degree of a Cycle Graph

Last Updated: 02 September 2022

Given the number of vertices in a Cycle Graph. The task is to find the Degree and the number of Edges of the cycle graph.Degree: Degree of any vertex is defined as the num...read more

Data Structures-Graph

Program to find the diameter, cycles and edges of a Wheel Graph

Last Updated: 26 December 2022

Wheel Graph: A Wheel graph is a graph formed by connecting a single universal vertex to all vertices of a cycle.Properties:Wheel graphs are Planar graphs.There is always a...read more

School Programming

Data Structures-Graph

Data Structures | Graph | Question 9

Last Updated: 28 June 2021

In which scenario would a directed acyclic graph (DAG) be most suitable? (A)Representing dependencies between tasks in a project schedule(B)Modeling ...read more

Data Structures

Data Structures

Data Structures-Graph

Data Structures | Graph | Question 8

Last Updated: 28 June 2021

Consider an undirected random graph of eight vertices. The probability that there is an edge between a pair of vertices is 1/2. What is the expected number of unordered cy ...read more

Data Structures

Data Structures

Data Structures-Graph

Data Structures | Graph | Question 9

Last Updated: 28 June 2021

Which of the following statements is/are TRUE for an undirected graph?P: The number of odd-degree vertices is evenQ: Sum of degrees of all vertices is even ...read more

Data Structures

Data Structures

Data Structures-Graph

Data Structures | Graph | Question 4

Last Updated: 28 June 2021

The most efficient algorithm for finding the number of connected components in an undirected graph on n vertices and m edges has time complexity. (A ...read more

Data Structures

Data Structures

Data Structures-Graph

Data Structures | Graph | Question 2

Last Updated: 19 November 2018

The degree sequence of a simple graph is the sequence of the degrees of the nodes in the graph in decreasing order. Which of the following sequences can not be the degree ...read more

Data Structures

Data Structures

Data Structures-Graph

Data Structures | Graph | Question 1

Last Updated: 28 June 2021

Which of the following is an advantage of adjacency list representation over adjacency matrix representation of a graph?(A) In adjacency list representation, space is save ...read more

Data Structures

Data Structures

Data Structures-Graph