Transportation Geography and Network Science/Topology

< Transportation Geography and Network Science

Circuits and Trees

Circuits and Trees are two basic structures of planar networks. A circuit is a closed path, with no less than three links, that begins and ends at the same node. A tree is a set of connected lines that cannot form a complete circuit. ^[1]

At the individual trip level, the treeness is estimated as:

$\phi _{tree}={\frac {l_{tb}}{l_{sb}}}$

where:

$l_{tb}$ = Length (km) of street segments belonging to a branch network within the buffer,

$l_{sb}$ = Total length (km) of the street network within the buffer.

References

↑ Open source software developed by Feng Xie, Metropolitan Washington Council of Governments (MWCOG) can be used to identify tree and circuit links on planar networks. Code can be downloaded from

This article is issued from Wikibooks. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.