Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with geometric-network
Search options answers only
not deleted
user 93656
A geometric network is a set of connected edges and junctions (nodes) along with connectivity rules that are used to represent and model the behavior of a common network infrastructure in the real world. Geodatabase feature classes are used as the data sources to define the geometric network. You define the roles that various features will play in the geometric network and rules for how resources flow through the geometric network.
3
votes
pgr_withPointsCost returns incorrect table values
Update, having access to exemplary data:
While my answer is still valid for your presented query, there is another issue with your setup that is not very well documented: your Point SQL produces verti …
- 30.9k
1
vote
Calculate id network
I quite recently found the ST_Cluster... family of functions to be the Holy Grail for these kind of tasks, with your task being close to this one.
Based on my answer there, something along the lines …
- 30.9k
5
votes
Accepted
PostGIS recursive query in order to find the longest connected subnetwork in my line network
The key here is to collect the visited edges into a path array and check against that in each iteration. Try
WITH RECURSIVE
connected_line AS (
SELECT 0 AS it,
ARRAY[a.id] AS path,
…
- 30.9k