The free, standard sDNA provides some of the best network analysis tools available, used in numerous pieces of research and consultancy worldwide.
For professional users, sDNA+ gives you access to our most up-to-date, most flexible, best tested models. Working alongside our public, private and third sector partners, we also figured out numerous workflow enhancements to save you time.
- Modelling pedestrians, cyclists, public transport or vehicles? Just select our best behaviour models from the menu
- Modelling something else? Use the same flexible system to develop models for your own needs
A 7 day evaluation of sDNA+ is available free of charge, once per team, no commercial use. To request evaluation, view prices and purchase, see sDNA+ Pricing.
For the technically minded, an in-depth comparison of features can be found below.
Current feature comparison | sDNA | sDNA+ |
Full user manual not as hard to understand as this list of features! |
![]() |
![]() |
Tested in the real world following extensive work with our private and third sector partners |
![]() |
![]() |
Machine Learning fit models to data with bayesian, entropy maximisation, multicollinearity-tolerant algorithms |
![]() |
![]() |
Generalized Cross-Validation test predictive ability without losing data for calibration |
![]() |
![]() |
GEH support run analysis to minimize geh for transport applications |
![]() |
![]() |
Multi scale analysis euclidean network radii |
![]() |
![]() |
Euclidean shortest paths | ![]() |
![]() |
Angular shortest paths | ![]() |
![]() |
Custom shortest paths | ![]() |
![]() |
Cyclist shortest paths easily model cyclist behaviour deterred by slope and motorized traffic |
![]() |
![]() |
Euclidean-angular shortest paths blend of both types for simple pedestrian analysis |
![]() |
![]() |
3d shortest paths taking account of height change in route choice |
![]() |
![]() |
Random perturbations to shortest paths modelling uncertainty and diversity in route choice |
![]() |
![]() |
Hybrid shortest paths combining all the above based on user formula |
![]() |
![]() |
Angular, custom, 3d, random, hybrid radius allows mode choice based on accessibility |
![]() |
![]() |
Preset metrics easily model pedestrian, vehicle, public transport behaviour |
![]() |
![]() |
One way shortest paths and radius respecting one way systems, escalators etc |
![]() |
![]() |
Scenario analysis enable/disable links without editing the network |
![]() |
![]() |
Turn metrics can refer to link data apply turn penalties in specific situations |
![]() |
![]() |
Banded radius for better multivariate modelling |
![]() |
![]() |
Advanced geodesic analysis and handling for conflicts between euclidean radius and angular/other geodesics |
![]() |
![]() |
Output destination shapes and data distance maps, isochrones, isokampters etc |
![]() |
![]() |
Output geodesic shapes and data profile population exposure along travel routes, users of given links etc |
![]() |
![]() |
Output flow bundles geodesics or flow maps for users of specific links |
![]() |
![]() |
Output network buffer shapes and data accessibility analysis |
![]() |
![]() |
Output convex hull shapes and data accessibility analysis |
![]() |
![]() |
Selective origin processing for detailed analysis of selected locations |
![]() |
![]() |
Link centre type overrides | ![]() |
![]() |
Grade separation and elevation support (you don’t need to know how high the bridges are) |
![]() |
![]() |
Link weighting now done without having to alter the network |
![]() |
![]() |
Length Weighting some people like this too |
![]() |
![]() |
Custom weighting based on user data per link, polyline or unit length |
![]() |
![]() |
Separate origin/destination weighting when you know where people are going |
![]() |
![]() |
Zonal weighting use weights from zones not links |
![]() |
![]() |
Hybrid weighting combine all other weighting types |
![]() |
![]() |
OD matrix import when you already know who is going where |
![]() |
![]() |
Skim matrix export when you want to predict who is going where |
![]() |
![]() |
Network preparation tool removing split links, duplicates, cluster tolerance problems, traffic islands and isolated systems |
![]() |
![]() |
Network preparation tool preserves numeric data either absolute or per unit length |
![]() |
![]() |
Mean distance accessibility measures for each geodesic type |
![]() |
![]() |
Gravity model type accessibility measures network quantity penalized by distance |
![]() |
![]() |
Customizable gravity model measures as above with user parameters |
![]() |
![]() |
Betweenness measures predictions of flow |
![]() |
![]() |
Two step floating catchment modified betweenness and quantity measures |
![]() |
![]() |
Raw quantity measures links, length, weight, angularity, geodesic lengths |
![]() |
![]() |
Junction measures junctions and connectivity |
![]() |
![]() |
Severence measures diversion ratios |
![]() |
![]() |
Efficiency measures based on convex hull geometry |
![]() |
![]() |
Individual link measures angularity, sinuosity, bearing, length, connectivity |
![]() |
![]() |
ArcGIS plugin arcgis 10.1 onwards |
![]() |
![]() |
Basic Autocad plugin for all products in the autocad family including map3d |
![]() |
![]() |
Advanced Autocad workflow for advanced features we recommend exporting from map3d to shapefile and using qgis |
![]() |
![]() |
QGIS Plugin qgis 2.8 onwards |
![]() |
![]() |
ArcGIS match symbology tool useful for displaying multiple networks on the same scale |
![]() |
![]() |
Autocad convert from link-unlink format useful for preparing hand-designed networks |
![]() |
![]() |
Workflows for advanced network preparation see the user manual for how to do this with the free qgis |
![]() |
![]() |
Command line interface for scripting large sets of analyses |
![]() |
![]() |
Python programming interface for complex analysis and parametric design |
![]() |
![]() |
Multi core, multi CPU support for faster analyses |
![]() |
![]() |
Subsampling allowing to trade off accuracy for increased speed |
![]() |
![]() |
Large scale networks using a 64 bit platform to process over 500,000 links |
![]() |
![]() |