Kesepuhan

Cirebon · Kampung kota

The kampung around the Kasepuhan kraton, threaded with gang named after trees and streets wide enough for one vehicle.

Drive

20.8 km · 93 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 2.915 · φ 0.52

Walk

29.1 km · 163 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 2.825 · φ 0.57

Delta

+8.4

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

+70
intersections per km²: −8.2%
Dead-end: −0.090
ΔH · orientation entropy

Both roses overlaid

Drive H 2.915 · φ 0.52Walk H 2.825 · φ 0.57

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.

Kesepuhan: driving and walking network metrics, their difference, and their position among 33 sites.
Metric	Drive	Walk	Delta	Position among 33 sites
Orientation entropynat	2.915	2.825	−0.090	Drive: position 5 of 33; Walk: position 5 of 33, when the set is sorted by this metric, smallest first.
H / H max	0.813	0.788	−0.025	Drive: position 5 of 33; Walk: position 5 of 33, when the set is sorted by this metric, smallest first.
φ orientation-order	0.516	0.571	+0.056	Drive: position 29 of 33; Walk: position 29 of 33, when the set is sorted by this metric, smallest first.
Circuitysampled	1.544	1.569	+0.025	Drive: position 17 of 33; Walk: position 25 of 33, when the set is sorted by this metric, smallest first.
Average node degree	2.22	2.38	+0.17	Drive: position 8 of 33; Walk: position 13 of 33, when the set is sorted by this metric, smallest first.
Four-way	4.2%	3.6%	−0.6%	Drive: position 11 of 33; Walk: position 1 of 33, when the set is sorted by this metric, smallest first.
Dead-end	35.7%	27.5%	−8.2%	Drive: position 27 of 33; Walk: position 19 of 33, when the set is sorted by this metric, smallest first.
Intersection density	93 /km²	163 /km²	+70 /km²	Drive: position 6 of 33; Walk: position 9 of 33, when the set is sorted by this metric, smallest first.
Median segment length	41 m	36 m	−6 m	Drive: position 21 of 33; Walk: position 21 of 33, when the set is sorted by this metric, smallest first.
Network length	20.8 km	29.1 km	+8.4 km	Drive: position 8 of 33; Walk: position 8 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: 447 pairs sampled · 40 pairs unreachable.Walk: 458 pairs sampled · 31 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: 8.4 km
Share of walking network: 28.7%

Where these numbers come from

Drive

Nodes: 353
Edges: 391
Intersections (degree ≥ 3): 187
Disc area: 2.01 km²
Intersection density: 93 /km²
Rose weighted length: 41.5 km
Per-edge circuity: 1.039

Walk

Nodes: 527
Edges: 628
Intersections (degree ≥ 3): 328
Disc area: 2.01 km²
Intersection density: 163 /km²
Rose weighted length: 58.3 km
Per-edge circuity: 1.055

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 — Kesepuhan

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°	1.17%	0.94%	0.0519	0.0440
01	5°–15°	0.38%	0.29%	0.0211	0.0171
02	15°–25°	0.64%	0.50%	0.0322	0.0264
03	25°–35°	0.30%	0.28%	0.0176	0.0166
04	35°–45°	0.64%	0.55%	0.0324	0.0287
05	45°–55°	2.18%	2.18%	0.0833	0.0833
06	55°–65°	11.38%	12.01%	0.2473	0.2545
07	65°–75°	9.44%	10.89%	0.2228	0.2414
08	75°–85°	2.34%	1.92%	0.0877	0.0760
09	85°–95°	0.84%	0.71%	0.0403	0.0352
10	95°–105°	0.39%	0.29%	0.0217	0.0170
11	105°–115°	0.26%	0.24%	0.0155	0.0143
12	115°–125°	0.22%	0.18%	0.0133	0.0113
13	125°–135°	0.50%	0.39%	0.0265	0.0216
14	135°–145°	2.03%	1.58%	0.0792	0.0656
15	145°–155°	9.23%	8.38%	0.2200	0.2077
16	155°–165°	6.35%	7.19%	0.1750	0.1893
17	165°–175°	1.71%	1.48%	0.0695	0.0622
18	175°–185°	1.17%	0.94%	0.0519	0.0440
19	185°–195°	0.38%	0.29%	0.0211	0.0171
20	195°–205°	0.64%	0.50%	0.0322	0.0264
21	205°–215°	0.30%	0.28%	0.0176	0.0166
22	215°–225°	0.64%	0.55%	0.0324	0.0287
23	225°–235°	2.18%	2.18%	0.0833	0.0833
24	235°–245°	11.38%	12.01%	0.2473	0.2545
25	245°–255°	9.44%	10.89%	0.2228	0.2414
26	255°–265°	2.34%	1.92%	0.0877	0.0760
27	265°–275°	0.84%	0.71%	0.0403	0.0352
28	275°–285°	0.39%	0.29%	0.0217	0.0170
29	285°–295°	0.26%	0.24%	0.0155	0.0143
30	295°–305°	0.22%	0.18%	0.0133	0.0113
31	305°–315°	0.50%	0.39%	0.0265	0.0216
32	315°–325°	2.03%	1.58%	0.0792	0.0656
33	325°–335°	9.23%	8.38%	0.2200	0.2077
34	335°–345°	6.35%	7.19%	0.1750	0.1893
35	345°–355°	1.71%	1.48%	0.0695	0.0622
Sum = H				2.915	2.825

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.