Flow Network

A Flow Network is a graph with a source node, a sink node and with edges with control flow.

• AKA: Transportation Network.
• Example(s):
  • Pipeline Network.
  • Road Network.
• Counter-Example(s):
  • Static Webpage.
• See: Control Flow, Graph, Graph Edge, Graph Node.

---

---

References

2015

• (Wikipedia, 2015) ⇒ https://www.wikipedia.com/en/Flow_network
  • QUOTE: 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, unless it is a source, which has only outgoing flow, or sink, which has only incoming flow. A network can be used to model traffic in a road system, circulation with demands, fluids in pipes, currents in an electrical circuit, or anything similar in which something travels through a network of nodes.

1996

• (Wall et al., 1996) ⇒ Larry Wall, Tom Christiansen, and Randal L. Schwartz. (1996). “Programming Perl, 2nd edition." O'Reilly. ISBN:1565921496
  • pipeline: A series of processes all in a row, linked by pipes, where each passes its output to the next.

---