Upgrade to access all content for this subject

Which of the following descriptions represents a flow network?

A directed graph where each edge has a nonnegative capacity along with a single source node and a single sink node with internal nodes in between.

A directed graph where each edge has a weight along with multiple source and sink nodes with internal nodes in between.

A directed graph which contains no cycle and each node has at most two child nodes.

A spanning tree of a directed graph where each edge has a non-negative weight.

An undirected graph whose nodes can be partitioned into two distinct sets and each edge in the graph has its two ends in different sets.