Shortest paths between two points
Return the shortest paths (using the Dijkstra algorithm) stream from the stream segment to which the given start point belongs to the stream segment to which the given end point belongs. They have to be in the same river basin. The path is returned as GeoJSON FeatureCollection or GeometryCollection, depending on user input. The geometries are LineStrings in both cases. The start and end segments are included.
dijkstra shortest-path stream stream-segment geojson GeoFRESH hydrography90m routing
| Id | Title | Data Type | Description |
|---|---|---|---|
| points | Points (GeoJSON) | string | GeoJSON: GeometryCollection of MultiPoint items (WGS84)- |
| geometry_only | Get only GeoJSON GeometryCollection? | Specify whether to return only a GeoJSON GeometryCollection (in this case, LineStrings), instead of a GeoJSON FeatureCollection containing additional properties. Please write "true" or "false". | |
| add_segment_ids | Add segment ids? | Specify whether to add the subcatchment ids of each segment along the path to the GeoJSON Feature's properties. Please write "true" or "false". | |
| comment | Comment | string | Arbitrary string that will not be processed but returned, for user"s convenience. |
| Id | Title | Description |
|---|---|---|
| paths_matrix | Shortest paths between the points | Shortest paths between the provided locations, as a matrix, stored as JSON. Possibly not ideal. Wprk in progress. Routing is done via Dijkstra algorithm. Subcatchment ids and strahler order of each line segment along the way are included. |
Execution modes
- Synchronous
- Asynchronous