Timeline for Using weight in geometric network to Find Path Upstream
Current License: CC BY-SA 3.0
19 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Jul 27, 2015 at 2:01 | vote | accept | Duc TN | ||
Jul 24, 2015 at 3:24 | history | edited | Farid Cheraghi | CC BY-SA 3.0 |
title and tags
|
Jul 24, 2015 at 2:08 | history | edited | Duc TN | CC BY-SA 3.0 |
added 294 characters in body
|
Jul 24, 2015 at 1:20 | answer | added | Farid Cheraghi | timeline score: 1 | |
Jul 23, 2015 at 11:30 | answer | added | Hornbydd | timeline score: 1 | |
Jul 23, 2015 at 7:58 | answer | added | Dror Har Gil | timeline score: 1 | |
Jul 23, 2015 at 5:01 | comment | added | Duc TN | Don't worry Chris, the Find Path Upstream is the function to find the path from junction to source, but what i'm trying to do is using weight to do it in a loop-network to find the shortest path. But thank you very much anw, I'm still waitting for somebody can help :) | |
Jul 23, 2015 at 4:34 | history | edited | Chris W | CC BY-SA 3.0 |
added 6 characters in body; edited title
|
Jul 23, 2015 at 4:32 | comment | added | Chris W | Sorry, I haven't worked with geometric network traces really, I was just going off help file searches. I guess I'm not really understanding why you can't set the source, or maybe that you're trying to do two things at once - both find a source and find the shortest path to that source. Perhaps someone with more experience using those trace/path tools can help. | |
Jul 23, 2015 at 4:17 | comment | added | Duc TN | Hi Chris, thanks for your comment. It's the Find Path function you mentioned, It works fine but I have to set flag to junction & source. In my case I have many junctions & I need to find path from those junctions to the "source" feature without set flag to "source", so I think I need to use the Find Path Upstream. But the issue is how can I solve that case? | |
Jul 23, 2015 at 4:00 | comment | added | Chris W | If you're using Find Path Upstream, maybe you're using the wrong tool. There's a Find Shortest Path tool that takes weights, and if no weights are present does it by the fewest edges. Presumably you'd use your length field of edges as weight. | |
Jul 23, 2015 at 2:39 | comment | added | Duc TN | I really need help, please someone give me an idea :( | |
S Jul 22, 2015 at 3:04 | history | suggested | TsvGis |
addded the tagg weighted
|
|
Jul 22, 2015 at 2:58 | review | Suggested edits | |||
S Jul 22, 2015 at 3:04 | |||||
Jul 22, 2015 at 2:07 | history | edited | Duc TN | CC BY-SA 3.0 |
added 18 characters in body
|
Jul 22, 2015 at 2:05 | comment | added | Duc TN | Oh sorry, i'm using ArcGIS Desktop 10.2 | |
Jul 21, 2015 at 20:20 | history | edited | PolyGeo♦ | CC BY-SA 3.0 |
deleted 59 characters in body; edited tags
|
Jul 21, 2015 at 17:28 | review | First posts | |||
Jul 21, 2015 at 17:59 | |||||
Jul 21, 2015 at 17:24 | history | asked | Duc TN | CC BY-SA 3.0 |