Graph Algorithms Pattern

DFS/BFS, topological sort, Dijkstra, and MST ideas.

#	Title	Difficulty	Topics
332	Reconstruct Itinerary	Medium	graph
765	Couples Holding Hands	Hard	graph
1042	Flower Planting With No Adjacent	Easy	graph
1349	Maximum Students Taking Exam	Hard	graph
1557	Minimum Number of Vertices to Reach All Nodes	Medium	graph
1719	Number Of Ways To Reconstruct A Tree	Hard	graph
1724	Checking Existence of Edge Length Limited Paths II	Hard	graph
1743	Restore the Array From Adjacent Pairs	Medium	graph
1761	Minimum Degree of a Connected Trio in a Graph	Hard	graph
1786	Number of Restricted Paths From First to Last Node	Medium	graph
1791	Find Center of Star Graph	Medium	graph
1820	Maximum Number of Accepted Invitations	Medium	graph
1971	Find if Path Exists in Graph	Medium	graph
1976	Number of Ways to Arrive at Destination	Medium	graph
2077	Paths in Maze That Lead to Same Room	Medium	graph
2093	Minimum Path Cost in a Hidden Grid	Medium	graph
2097	Valid Arrangement of Pairs	Medium	graph
2123	Minimum Operations to Remove Adjacent Ones in Matrix	Hard	graph
2127	Maximum Employees to Be Invited to a Meeting	Hard	graph
2203	Minimum Weighted Subgraph With the Required Paths	Medium	graph
2204	Distance to a Cycle in Undirected Graph	Medium	graph
2242	Maximum Score of a Node Sequence	Medium	graph
2699	Modify Graph Edge Weights	Medium	graph
2737	Find the Closest Marked Node	Medium	graph
3112	Minimum Time to Visit Disappearing Nodes	Medium	graph
3123	Find Edges in Shortest Paths	Medium	graph