Graph

Len Chen

·

Follow

1 min read

·

Feb 18, 2020

--

Listen

Share

Questions

Basic

• 1733. Minimum Number of People to Teach
• 1743. Restore the Array From Adjacent Pairs
• 133. Clone Graph
• 886. Possible Bipartition
• 743. Network Delay Time
• 1631. Path With Minimum Effort
• 787. Cheapest Flights Within K Stops
• 1334. Find the City With the Smallest Number of Neighbors at a Threshold Distance
• 399. Evaluate Division
• 1192. Critical Connections in a Network
• 996. Number of Squareful Arrays

Solutions

Basic

• 1733. Minimum Number of People to Teach

• 1743. Restore the Array From Adjacent Pairs

• 133. Clone Graph

• 886. Possible Bipartition

• 743. Network Delay Time

• 1631. Path With Minimum Effort

• 787. Cheapest Flights Within K Stops

• 1334. Find the City With the Smallest Number of Neighbors at a Threshold Distance

• 399. Evaluate Division

• 1192. Critical Connections in a Network

• 996. Number of Squareful Arrays

Supplements

Minimum Spanning Tree

Shortest Path

• Single Source on Directed Graph with Nonnegative Weights

• Single Source on Weighted Directed Acyclic Graph (DAG)

• Single Source on Weighted Directed Graph without Negative Cycles

• All Pairs on Weighted Directed Graph without Negative Cycles

Articulation Points/Edges

Traveling Salesman Problem