Encyclopedia > N > Network flow
Network flow
In graph theory, a network flow is an assignment of flow to the edges of a directed graph (called a flow network in this case) where each edge has a capacity, such that the amount of flow along an edge does not exceed its capacity. In addition you have the restriction that the amount of flow into a node equals the amount of flow out of it, except if it is a source, which only has outgoing flow, or sink, which has only incoming flow.
Information are taken from Wikipedia, the open encyclopedia, to which contribute many volunteers from around the whole world. Texts are available under the following conditions GNU Free Documentation License.
Encyklopedie (cz) Encyklopédia (sk) Enzyklopädie (de)