In graph theory, a flow network (also known as a transportation network) is a directed graph where each edge has a capacity and each edge receives a flow. The amount of flow on an edge cannot exceed the capacity of the edge. Often in Operations Research, a directed graph is called a network, the vertices are called nodes and the edges are called arcs. A flow must satisfy the restriction that the amount of flow into a node equals the amount of flow out of it, except when it is a source, which has more outgoing flow, or sink, which has more incoming flow. A network can be used to model traffic in a road system, fluids in pipes, currents in an electrical circuit, or anything similar in which something travels through a network of nodes.
Other articles related to "flow network, flow, network":
... The following example shows the first steps of Ford–Fulkerson in a flow network with 4 nodes, source and sink ... In each step, only a flow of is sent across the network ... Path Capacity Resulting flow network Initial flow network After 1998 more steps … Final flow network Notice how flow is "pushed back" from to when finding the path ...
Famous quotes containing the words network and/or flow:
“Of what use, however, is a general certainty that an insect will not walk with his head hindmost, when what you need to know is the play of inward stimulus that sends him hither and thither in a network of possible paths?”
—George Eliot [Mary Ann (or Marian)
“Logic and fact keep interfering with the easy flow of conversation.”
—Mason Cooley (b. 1927)