# Analyze graph

Graph networks can be analyzed by computing *global integration*, *local integration* and *inbetween centrality*. For each street these three values are computed and stored as object attribute "integrationGlobal", "integrationLocal" and "inbetweenCentrality". The values can be visualized or used to approximate street widths.

## Settings

**Mode**: Three modes are available:**Calculate analysis only (as object attribute):**For each street the three analysis values*global integration*,*local integration*and*inbetween centrality*are computed. These values are stored as object attributes.**Visualize analysis (assign rule):**Computes the three analysis values and assigns a visualization rule file to the street shapes. Model generation is automatically triggered. The visualization can be configured by selecting street shapes and using the inspector.**Set street width (based on integration):**Computes the three analysis values and maps the*local integration*to the range specified by*Street Width Min*and*Street Width Max*. After running the tool, select the street layer to see/change the mapping code in the layer attributes in the inspector.**Depth of local integration:**The number of 90 degree turns to take into account to compute the*local integration*value.**Street Width Min:**Street width lower bound, only used in*Set street width*mode.**Street Width Max:**Street width upper bound, only used in*Set street width*mode.

## Definitions

All shortest paths between all selected street segments are computed. The shortest path cost function is the sum of all angles between the segments along the path.### Global integration

For each street segment, the shortest paths to all other segments are summed up. Each sum is then divided by the square of the number of segments. Next, each value is inverted. Finally, the values are normalized so that each value is in the range zero to one.### Local integration

For each street segment, the shortest paths to all other segments which are closer than*(Depth of local integration)*90 degree turns are summed up. Each sum is then divided by the square of the number of visited segments. Next, each value is inverted. Finally, the values are normalized so that each value is in the range zero to one.

### Inbetween centrality

For each street segment, the number of shortest paths which pass this segment is computed. Then, the values are normalized so that each value is in the range zero to one.## Example

Copyright ©2008-2016 Esri R&D Center Zurich. All rights reserved.