Methodenbewijsdossier

Network Distance Analysis

Network distance analysis measures how far apart places are along a real network — roads, paths, rails — rather than as the crow flies, recognizing that movement is constrained to edges and junctions. Its engine is the shortest-path problem solved by Dijkstra's 1959 algorithm, which finds the least-cost route between locations over a weighted graph and scales up to origin–destination cost matrices between many points. Network distance and travel time are the realistic inputs to accessibility, routing, location, and flow analyses, and their ratio to straight-line distance — the detour or circuity index — itself diagnoses how indirect a network is.

Sources recorded, not reviewed

Bronrecord

Citaten letterlijk overgenomen uit het bronrecord van de methode. Hieruit wordt geen verificatie op claimniveau afgeleid.

Network Distance Analysis (Shortest-Path and OD Cost Matrices)

Taxonomisch methodendossier · process-pipeline / human-geography

Dijkstra, E. W. (1959). A note on two problems in connexion with graphs. Numerische Mathematik, 1(1), 269–271. · DOI 10.1007/BF01386390

Volledige methode openen

Gecureerde claims

Claims opgeslagen in het bewijsregister, elk met zijn eigen beoordeling.

Nog geen gecureerde claims

Deze weergave verzint geen claimbeoordeling als het register er geen heeft.

Gerelateerde methoden

Gegenereerd uit de methodegraaf en getoond als machinaal voorgestelde relaties — er wordt geen bewijsclaim afgeleid.

Same method familyAccessibility Analysismachine-suggested · Relational suggestion, not evidence.Same method familyDesire Line Analysismachine-suggested · Relational suggestion, not evidence.Same method familyFlow Mapping Analysismachine-suggested · Relational suggestion, not evidence.Same method familyIsochrone Analysismachine-suggested · Relational suggestion, not evidence.