Graph Algorithms

Numerical answer

Answer key coming soon

One or more correct

• ARoot of $T$ can never be an articulation point in $G$.
• BRoot of $T$ is an articulation point in $G$ if and only if it has 2 or more children.
• CA leaf of $T$ can be an articulation point in $G$.
• DIf $u$ is an articulation point in $G$ such that $x$ is an ancestor of $u$ in $T$ and $y$ is a descendent of $u$ in $T$, then all paths from $x$ to $y$ in $G$ must pass through $u$.

Answer key coming soon

Single correct

• ABoth $S_1$ and $S_2$ are true.
• B$S_1$ is true and $S_2$ is false.
• C$S_1$ is false and $S_2$ is true.
• DBoth $S_1$ and $S_2$ are false.

Answer key coming soon

Numerical answer

Answer key coming soon

One or more correct

• AThe graph does not have a topological order.
• BA depth-first traversal starting at vertex S classifies three directed edges as back edges.
• CThe graph does not have a strongly connected component.
• DFor each pair of vertices $u$ and $v$, there is a directed path from $u$ to $v$.

Answer key coming soon

Numerical answer

Answer key coming soon