Kampung Code

Yogyakarta · Kampung kota

A terraced kampung on the bank of the Code, where much of the network is steps.

Drive

36.2 km · 190 intersections/km²

Fig. 1 · r = 800 m — The drivable network inside the sampling disc. Uniform ink, no road-class hierarchy, no basemap: the shape is the subject.

Drive H 3.141 · φ 0.36

Walk

52.8 km · 326 intersections/km²

Fig. 2 · r = 800 m — The walkable network at the same centre, the same disc, the same extract. Every difference from the drawing beside it is the tag mapping, not a different place.

Walk H 3.094 · φ 0.40

Delta

+16.7

km of network reachable only on foot · 31.6% of the walking network

+136
intersections per km²: −0.7%
Dead-end: −0.046
ΔH · orientation entropy

Both roses overlaid

Drive H 3.141 · φ 0.36Walk H 3.094 · φ 0.40

Drive
Walk
Both

Two readings, one table

Hairlines: every site in the set, both modes. Marks: this site. A position, not a value — neither end is better.

Kampung Code: driving and walking network metrics, their difference, and their position among 33 sites.
Metric	Drive	Walk	Delta	Position among 33 sites
Orientation entropynat	3.141	3.094	−0.046	Drive: position 16 of 33; Walk: position 15 of 33, when the set is sorted by this metric, smallest first.
H / H max	0.876	0.863	−0.013	Drive: position 16 of 33; Walk: position 15 of 33, when the set is sorted by this metric, smallest first.
φ orientation-order	0.363	0.396	+0.033	Drive: position 18 of 33; Walk: position 19 of 33, when the set is sorted by this metric, smallest first.
Circuitysampled	1.451	1.400	−0.052	Drive: position 14 of 33; Walk: position 10 of 33, when the set is sorted by this metric, smallest first.
Average node degree	2.42	2.53	+0.11	Drive: position 26 of 33; Walk: position 27 of 33, when the set is sorted by this metric, smallest first.
Four-way	6.7%	14.9%	+8.2%	Drive: position 23 of 33; Walk: position 28 of 33, when the set is sorted by this metric, smallest first.
Dead-end	24.9%	24.2%	−0.7%	Drive: position 8 of 33; Walk: position 13 of 33, when the set is sorted by this metric, smallest first.
Intersection density	190 /km²	326 /km²	+136 /km²	Drive: position 23 of 33; Walk: position 27 of 33, when the set is sorted by this metric, smallest first.
Median segment length	31 m	23 m	−8 m	Drive: position 7 of 33; Walk: position 5 of 33, when the set is sorted by this metric, smallest first.
Network length	36.2 km	52.8 km	+16.7 km	Drive: position 20 of 33; Walk: position 24 of 33, when the set is sorted by this metric, smallest first.

H is in nats — the natural-log unit of information. That is why its maximum is ln 36 ≈ 3.584 rather than log₂ 36.

Circuity is an estimate: network distance over straight-line distance, averaged across a seeded sample of node pairs rather than across all of them. Drive: 403 pairs sampled · 87 pairs unreachable.Walk: 440 pairs sampled · 54 pairs unreachable. Pairs with no route between them at all are excluded from the mean. A large count means this network is fragmented — a signal about the data, not about the place.

Each street segment’s bearing goes into one of 36 bins of 10°, weighted by length: a 500 m road counts ten times a 50 m gang. Bar length is the share of network length running that way, not a count of segments. The rose is always 180°-symmetric, because one segment traversed both ways differs by exactly 180°. Boeing 2019 §3

Fig. 3 · r = 800 m

What walking adds

Ink: the edges that exist only in the walking network. Hairline: the network both modes share. Membership is decided by the tag mapping — an edge counts as walk-only when the OSM way it came from is not admitted to the driving network.

Walk-only length: 16.7 km
Share of walking network: 31.6%

Where these numbers come from

Drive

Nodes: 638
Edges: 772
Intersections (degree ≥ 3): 382
Disc area: 2.01 km²
Intersection density: 190 /km²
Rose weighted length: 72.4 km
Per-edge circuity: 1.038

Walk

Nodes: 1061
Edges: 1342
Intersections (degree ≥ 3): 655
Disc area: 2.01 km²
Intersection density: 326 /km²
Rose weighted length: 105.7 km
Per-edge circuity: 1.047

The intermediate values the column above is built from. Intersection density is the intersection count over the disc area; the weighted length is the denominator that turns a rose bar into a share. Two different circuity measures: the per-edge one compares each segment against its own chord, the sampled one compares distances between junctions. The first measures how much streets bend, the second how far out of your way the network takes you.

Rose as a table — 36 bins — Kampung Code

Share of network length per 10° bearing bin, for drive and walk.
Bin	Bearing range	P — Drive	P — Walk	−P·ln P	−P·ln P
00	355°–5°	4.67%	5.32%	0.1431	0.1561
01	5°–15°	8.92%	9.64%	0.2156	0.2255
02	15°–25°	1.86%	1.73%	0.0741	0.0701
03	25°–35°	0.65%	0.71%	0.0328	0.0351
04	35°–45°	0.52%	0.61%	0.0273	0.0310
05	45°–55°	1.83%	1.60%	0.0733	0.0661
06	55°–65°	1.34%	1.06%	0.0579	0.0483
07	65°–75°	2.82%	2.16%	0.1007	0.0828
08	75°–85°	3.22%	2.98%	0.1106	0.1048
09	85°–95°	11.16%	12.01%	0.2447	0.2546
10	95°–105°	5.10%	4.63%	0.1519	0.1423
11	105°–115°	2.90%	2.21%	0.1028	0.0844
12	115°–125°	0.68%	0.68%	0.0341	0.0340
13	125°–135°	0.67%	0.54%	0.0336	0.0284
14	135°–145°	0.70%	0.67%	0.0348	0.0335
15	145°–155°	0.46%	0.49%	0.0250	0.0259
16	155°–165°	1.47%	1.59%	0.0622	0.0658
17	165°–175°	1.00%	1.36%	0.0459	0.0584
18	175°–185°	4.67%	5.32%	0.1431	0.1561
19	185°–195°	8.92%	9.64%	0.2156	0.2255
20	195°–205°	1.86%	1.73%	0.0741	0.0701
21	205°–215°	0.65%	0.71%	0.0328	0.0351
22	215°–225°	0.52%	0.61%	0.0273	0.0310
23	225°–235°	1.83%	1.60%	0.0733	0.0661
24	235°–245°	1.34%	1.06%	0.0579	0.0483
25	245°–255°	2.82%	2.16%	0.1007	0.0828
26	255°–265°	3.22%	2.98%	0.1106	0.1048
27	265°–275°	11.16%	12.01%	0.2447	0.2546
28	275°–285°	5.10%	4.63%	0.1519	0.1423
29	285°–295°	2.90%	2.21%	0.1028	0.0844
30	295°–305°	0.68%	0.68%	0.0341	0.0340
31	305°–315°	0.67%	0.54%	0.0336	0.0284
32	315°–325°	0.70%	0.67%	0.0348	0.0335
33	325°–335°	0.46%	0.49%	0.0250	0.0259
34	335°–345°	1.47%	1.59%	0.0622	0.0658
35	345°–355°	1.00%	1.36%	0.0459	0.0584
Sum = H				3.141	3.094

The last column is each bin’s term in H = −Σ P(i)·ln P(i). Add the thirty-six of them and you get the H printed under the rose. An empty bin contributes zero.

Download this site’s data (JSON, ODbL)

Data jalan © OpenStreetMap contributors, ODbL 1.0. Basis data turunan ini ditawarkan dengan lisensi yang sama. · Boeing, G. 2019. Urban Spatial Order: Street Network Orientation, Configuration, and Entropy. Applied Network Science 4(1):67.