- DSA Problems
Minimum Number of Vertices to Reach All Nodes
Find the minimum set of vertices needed to reach all nodes in a directed acyclic graph using topological sorting and in-degree analysis.
- DSA Problems
Rotting Oranges Java Solution with BFS
Complete Java implementation of the rotting oranges problem using breadth-first search to find minimum time for all oranges to rot.
- DSA Patterns
Depth-First Search and Connected Components in Graph Algorithms
Comprehensive guide to DFS traversal and connected components detection in undirected graphs with Java implementations.
#Graph
Browse articles tagged with #Graph