Graph Algorithms

Single correct

• A$\Theta(|E| + |V|)$
• B$\Theta(|E||V|)$
• C$\Theta(|E| \log |V|)$
• D$\Theta(|V|)$

Answer key coming soon

Single correct

• Afor every $f : V \to \mathbb{R}$
• Bif and only if $\forall u \in V$, $f(u)$ is positive
• Cif and only if $\forall u \in V$, $f(u)$ is negative
• Dif and only if $f(u)$ is the distance from $s$ to $u$ in the graph obtained by adding a new vertex $s$ to $G$ and edges of zero weight from $s$ to every vertex of $G$

Answer key coming soon

Numerical answer

Answer key coming soon