Degree counting [mp]

Micro pattern¶

Description¶

Summarize incoming or outgoing edges per vertex to identify sources, terminals, or candidate relationships.

Problems¶

• 207. Course Schedule (Top Hard)
• 210. Course Schedule II (Top Hard)
• 329. Longest Increasing Path in a Matrix (Top Hard)
• 802. Find Eventual Safe States (Graph Theory)
• 997. Find the Town Judge (Graph Theory)
• 1557. Minimum Number of Vertices to Reach All Nodes (Graph Theory)
• 1615. Maximal Network Rank (Graph Theory)
• 1203. Sort Items by Groups Respecting Dependencies (Graph Theory)
• 1857. Largest Color Value in a Directed Graph (Graph Theory)