## Network Flow Analysis

Network Flow Analysis is a method to examine flow through networks. In Graph Theory (mathematical structures used to model pairwise relations between objects), flow network is known as a transportation network and it is a graph where each edge has a specific capacity and a this relates to its maximum possible flow. The method is widely used to diagnose computer data systems, transport congestion, people in airports and material flows.

The first two pages explain its mathematics behind the theory based on three simple rules, which are

- The flow along an edge cannot exceed its capacity
- The net flow from U to V must be the opposite of the net flow from V to U
- The net flow to a node is zero, except for the source, which “produces” flow, and the sink, which “consumes” flow.

The third page is a visual elaboration of the network flows of electricity in UK. It is designed based on the UK electricity supply data 2014 and the electricity supply system 2014 along with the future energy supply prediction. The efficiency of each energy source was visualised using Michigan Energy Use 2008 model and Birley Fields (MMU) sustainability information.

Manchester School of Architecture. MArch Program. CPU (Complexity Planning & Urbanism)

Students: Chai Yun Chung, Chen Chang

Supervisors: Ulysses Sengupta, Rob Hyde, Deljana Iossifova, Eric Cheung, Dan Newport

26 January 2016

Tags: @TheMSArch, #complexurban, architecture, capacity, cities, city, complex, complexity, flow, flows, network, network graph, urban futures, urbanism