LeetCode 882: Reachable Nodes In Subdivided Graph
Problem Restatement We are given an undirected graph with original nodes numbered from 0 to n - 1 . Each edge is written as: [u, v, cnt] This means the original edge between u and v is subdivided by adding cnt new nodes between them. For example: [0, 1, 3] becomes: 0 - x1 - x2 - x3 - 1 So moving from 0 to 1 through this edge takes...