Graph

930+ posts

Data Structure Types, Classifications and Applications

Last Updated: 21 December 2023

What is Data Structure:A data structure is a storage that is used to store and organize data. It is a way of arranging data on a computer so...read more

Arrays

Strings

Linked List

Tree

Travelling Salesman Problem using Dynamic Programming

Last Updated: 19 April 2023

Travelling Salesman Problem (TSP):Given a set of cities and the distance between every pair of cities, the problem is to find the shortest p...read more

Detect cycle in an undirected graph

Last Updated: 19 June 2024

Given an undirected graph, The task is to check if there is a cycle in the given graph.Examples:Input: N = 4, E = 4 Output: Yes Explanation...read more

Similar Topics

DSA

22.1k+ articles

Mathematical

7.7k+ articles

Arrays

6.4k+ articles

Competitive Programming

2.2k+ articles

Algorithms

2k+ articles

Tree

1.4k+ articles

Data Structures

1.1k+ articles

Recursion

1k+ articles

DFS

340+ articles

BFS

210+ articles

Strongly Connected Components

Last Updated: 06 June 2024

Strongly Connected Components (SCCs) are a fundamental concept in graph theory and algorithms. In a directed graph, a Strongly Connected Com...read more

Last Updated: 28 April 2024

Topological sorting for Directed Acyclic Graph (DAG) is a linear ordering of vertices such that for every directed edge u-v, vertex u comes ...read more

Bellman–Ford Algorithm

Last Updated: 04 April 2024

Imagine you have a map with different cities connected by roads, each road having a certain distance. The Bellman–Ford algorithm is like a...read more

How to find Shortest Paths from Source to all Vertices using Dijkstra's Algorithm

Last Updated: 04 June 2024

Given a weighted graph and a source vertex in the graph, find the shortest paths from the source to all the other vertices in the given grap...read more

Vizury Interactive Solutions

Greedy

Shortest Path

DSA

Prim’s Algorithm for Minimum Spanning Tree (MST)

Last Updated: 16 February 2024

Introduction to Prim's algorithm:We have discussed Kruskal's algorithm for Minimum Spanning Tree. Like Kruskal's algorithm, Prim’s algori...read more

Amazon

Minimum Spanning Tree

Graph and its representations

Last Updated: 02 January 2024

What is Graph Data Structure?A Graph is a non-linear data structure consisting of vertices and edges. The vertices are sometimes also referr...read more

Graph

graph-basics

DSA

Kruskal’s Minimum Spanning Tree (MST) Algorithm

Last Updated: 05 October 2023

A minimum spanning tree (MST) or minimum weight spanning tree for a weighted, connected, undirected graph is a spanning tree with a weight l...read more

Introduction to Disjoint Set (Union-Find Algorithm)

Last Updated: 19 April 2024

What is a Disjoint set data structure?Two sets are called disjoint sets if they don't have any element in common, the intersection of sets i ...read more

Graph

Huawei

union-find

QA - Placement Quizzes-Data Interpretation

Floyd Warshall Algorithm

Last Updated: 04 April 2024

The Floyd-Warshall algorithm, named after its creators Robert Floyd and Stephen Warshall, is a fundamental algorithm in computer science and...read more

Detect Cycle in a Directed Graph

Last Updated: 19 June 2024

Given the root of a Directed graph , The task is to check whether the graph contains a cycle or not. Examples: Input: N = 4, E = 6 Outpu...read more

Breadth First Search or BFS for a Graph

Last Updated: 23 April 2024

Breadth First Search (BFS) is a fundamental graph traversal algorithm. It involves visiting all the connected nodes of a graph in a level-by...read more

Depth First Search or DFS for a Graph

Last Updated: 16 February 2024

Depth First Traversal (or DFS) for a graph is similar to Depth First Traversal of a tree. The only catch here is, that, unlike trees, graphs...read more

1 2 3 4 5 6 7 8 >>

1 2 3 4 5 6 >>

1 2 3 4 >>