Graph

820+ posts

Similar Topics

DSA

20.6k+ articles

Mathematical

7.6k+ articles

Arrays

6.3k+ articles

Competitive Programming

1.4k+ articles

1.3k+ articles

1.2k+ articles

970+ articles

810+ articles

340+ articles

200+ articles

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

Last updated: 01 June 2023

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

Bellman–Ford Algorithm

Last updated: 04 September 2023

Bellman-Ford AlgorithmBellman-Ford is a single source shortest path algorithm that determines the shortest path between a given source vertex and every other vertex in a g...read more

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

Last updated: 22 June 2023

Given a graph and a source vertex in the graph, find the shortest paths from the source to all vertices in the given graph.Examples:Input: src = 0, the graph is shown belo...read more

Vizury Interactive Solutions

Greedy

Shortest Path

DSA

Prim’s Algorithm for Minimum Spanning Tree (MST)

Last updated: 04 August 2023

Introduction to Prim's algorithm:We have discussedKruskal's algorithm for Minimum Spanning Tree. Like Kruskal's algorithm, Prim’s algorithm is also aGreedy algorithm. This...read more

Amazon

Minimum Spanning Tree

Graph and its representations

Last updated: 01 August 2023

What is Graph Data Structure?A Graph is a non-linear data structure consisting of vertices and edges. The vertices are sometimes also referred to as nodes and the edges ar...read more

Graph

graph-basics

DSA

Kruskal’s Minimum Spanning Tree (MST) Algorithm

Last updated: 31 July 2023

A minimum spanning tree (MST) or minimum weight spanning tree for a weighted, connected, undirected graph is a spanning tree with a weight less than or equal to the weight...read more

Introduction to Disjoint Set (Union-Find Algorithm)

Last updated: 14 September 2023

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 is a null set.A data structure t ...read more

Floyd Warshall Algorithm | DP-16

Last updated: 07 July 2023

The Floyd Warshall Algorithm is for solving all pairs of shortest-path problems. The problem is to find the shortest distances between every pair of vertices in a given ed...read more

Detect Cycle in a Directed Graph

Last updated: 13 September 2023

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 Output: YesExplanation: The diagram clearly...read more

Breadth First Search or BFS for a Graph

Last updated: 09 June 2023

The Breadth First Search (BFS) algorithm is used to search a graph data structure for a node that meets a set of criteria. It starts at the root of the graph and visits al...read more

Depth First Search or DFS for a Graph

Last updated: 09 June 2023

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 may contain cycles (a node may...read more

1 2 3 4 5 6 7 8 >>

1 2 3 4 5 6 >>

1 2 3 4 >>