City2Graph · Analyze metapaths

Connect Burjassot amenities through the street network: build a street dual graph, bridge amenities to segments, and materialize amenity-to-amenity relations by hop count or by weight. Mirrors the Metapath Analysis panel.

Needs a drive or walk street network and an amenities feature object (Import urban data).

1. Configure the analysis

Set the Amenities Object, K Neighbors (how many segments each amenity bridges to, default 1) and an Amenity Limit to cap large areas.

Configuring the amenities object and parameters.

2. Materialize by hops

Hops (default 3) is the reach. Compute Metapaths builds the street dual graph, bridges amenities to their nearest segments, and connects amenities reachable within that many segment hops.

Amenity-to-amenity metapaths within 3 hops.

3. Materialize by weight

Set the Weight Attr (length, for instance), a Threshold, an optional Min Threshold and the Endpoint Type. A Dijkstra search connects the amenities falling inside that cost band.

Weighted metapaths within a cost band.

4. Inspect and visualize

Convert to Mesh in Result & Inspect draws the metapath curves in the viewport. Edge multiplicity there reflects how many distinct paths connect each amenity pair.

Metapath curves drawn in the viewport.

Next steps

Model public transport: GTFS-based graphs.