Graph Theory37 sections · 1633 units
Open in CourseQuiz: Matching States
Knowledge check
Check Your Understanding
In the tree matching DP, you track dp[u][0] and dp[u][1]. What do these states represent?
- A.
dp[u][0]: u is not selected as a node.dp[u][1]: u is selected as a node. - B.
dp[u][0]: u does not use an edge to its parent.dp[u][1]: u uses an edge to its parent. - C.
dp[u][0]: subtree of u has matched edges.dp[u][1]: subtree has . - D.
dp[u][0]: u is a leaf.dp[u][1]: u is internal.