tag

#strongly-connected-component

2 pages tagged

Practice › LeetCode › LeetCode 15xx ›

LeetCode 1568 - Minimum Number of Days to Disconnect Island

LeetCode Problem 1568 Difficulty: 🔴 Hard Topics: Array, Depth-First Search, Breadth-First Search, Matrix, Strongly Connected Component Solution Problem Understanding The problem gives us a binary matrix where each cell is either land ( 1 ) or water ( 0 ). Land cells that touch vertically or horizontally belong to the same island. A grid is considered connected only when there is exactly one island in the entire grid. Every day,...

Practice › LeetCode › LeetCode 14xx ›

LeetCode 1489 - Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree

LeetCode Problem 1489 Difficulty: 🔴 Hard Topics: Union-Find, Graph Theory, Sorting, Minimum Spanning Tree, Strongly Connected Component Solution Problem Understanding The problem gives us a connected, weighted, undirected graph with n vertices and a list of edges. Each edge is represented as [u, v, weight] , meaning there is a bidirectional connection between vertices u and v with the given cost. The goal is not simply to compute one Minimum...