题目内容

Decide whether you think the following statement is true or false. Let $G$ be an arbitrary flow network, with a source $s$, a sink $t$, and a positive integer capacity $c_e$ on every edge $e\ $. If $f\ $ is a maximum $s-t$ flow in $G\ $, then $f$ saturates every edge out of $s$ with flow (i.e., for all edges $e$out of $s$, we have$ f (e) = c_e$).

A. 正确
B. 错误

查看答案

搜索结果不匹配？点我反馈

更多问题

Gale-Shapley algorithm finds a stable matching in _____ time.

A. $O(n)$
B. $ O(n\log n)$
C. $O(n^2)$

$f(n) = \log n$ is ___; $g(n) = 2n + 1$ is _; $h(n) = f(n) + g(n)$ is ___.

A. $O(n); O(n); O(n)$
B. $\Omega(n); O(n^2); O(n)$
C. $O(n); \Omega(n^2); O(n)$

An algorithm has running time $T(n)$, which satisfies $T(n) \leq T(n/2) + c$ and $T(2) \leq c$.Then its running time is _____.

A. $O(n \log n)$
B. $O(n)$
C. $O(1)$
D. $O(\log n)$

A binary tree is a rooted tree in which each node has at most two children.What is the relation between the number of nodes with two children $ n_1 $ and thenumber of leaves (the nodes without children) $ n_2 $ in a binary tree?

A. $ 2n_1=n_2 $
B. $ n_1=n_2 $
C. $ n_1+1=n_2 $