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.
Read more about Flow Network: Definition, Example, Applications
Famous quotes containing the words flow and/or network:
“For as the interposition of a rivulet, however small, will occasion the line of the phalanx to fluctuate, so any trifling disagreement will be the cause of seditions; but they will not so soon flow from anything else as from the disagreement between virtue and vice, and next to that between poverty and riches.”
—Aristotle (384–322 B.C.)
“Parents need all the help they can get. The strongest as well as the most fragile family requires a vital network of social supports.”
—Bernice Weissbourd (20th century)