Choice The choice measure is easiest to understand as a 'water-flow' in the street network. Imagine that each street segment is given an initial load of one unit of water, which then starts pouring from the starting street segment to all segments that successively connect to it. Each time an intersection appears, the remaining value of flow is divided equally among the splitting streets, until all the other street segments in the graph are reached. For instance, at the first intersection with a single other street, the initial value of one is split into two remaining values of one half, and allocated to the two intersecting street segments. Moving further down, the remaining one half value is again split among the intersecting streets and so on. When the same procedure has been conducted using each segment as a starting point for the initial value of one, a graph of final values appears. The streets with the highest total values of accumulated flow are said to have the highest choice values.
Choice The choice measure is easiest to understand as a 'water-flow' in the street network Imagine that each street segment is given an initial load of one unit of water which then starts pouring from the starting street segment to all segments that successively connect to it Each time an intersection appears the remaining value of flow is divided equally among the splitting streets until all the other street segments in the graph are reached For instance at the first intersection with a single other street the initial value of one is split into two remaining values of one half and allocated to the two intersecting street segments Moving further down the remaining one half value is again split among the intersecting streets and so on When the same procedure has been conducted using each segment as a starting point for the initial value of one a graph of final values appears The streets with the highest total values of accumulated flow are said to have the highest choice values