tag:blogger.com,1999:blog-5484856836000112630.post4648323623405146808..comments2009-12-12T08:06:52.437-05:00Jose Vidalhttps://profiles.google.com/106856055579609524105noreply@blogger.comBlogger1125tag:blogger.com,1999:blog-5484856836000112630.post-17603562553434155742009-11-19T06:56:42.486-05:002009-11-19T06:56:42.486-05:00In graph theory, a flow 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.matt johnhttp://www.blogger.com/profile/00195478489610602354noreply@blogger.com