Adjacency list [mp]

Micro pattern¶

Description¶

Represent each graph vertex by a collection of its directly connected neighbors.

Problems¶

• BFS (DSA)
• DFS (DSA)
• 1042. Flower Planting With No Adjacent (Google Prep)
• 207. Course Schedule (Top Hard)
• 210. Course Schedule II (Top Hard)
• 802. Find Eventual Safe States (Graph Theory)
• 841. Keys and Rooms (Graph Theory)
• 1129. Shortest Path with Alternating Colors (Graph Theory)
• 1376. Time Needed to Inform All Employees (Graph Theory)
• 1466. Reorder Routes to Make All Paths Lead to the City Zero (Graph Theory)
• 797. All Paths From Source to Target (Graph Theory)
• 1192. Critical Connections in a Network (Graph Theory)
• 1615. Maximal Network Rank (Graph Theory)
• 785. Is Graph Bipartite? (Graph Theory)
• 721. Accounts Merge (Graph Theory)
• 1203. Sort Items by Groups Respecting Dependencies (Graph Theory)
• 1857. Largest Color Value in a Directed Graph (Graph Theory)