networkx shortest path errorHow to visualize shortest path that is calculated using Networkx?Shortest Path Analysis - FMENetworkX: Saving Shortest path of OpenStreetMap data as an OGR friendly formatShortest path calculation from shapefile data using GeoTools?How to connect nodes via shortest path along network lines with GRASS v.net modules?Create MultiDiGraph from Shapefile using NetworkxCalculation of fastest path with in network analysis by qgis 3.0Yen's or Eppstein for path with intermediate destinations which are dangling nodesNetworkX - Indexed Spatial node queries?Shortest path between one point to every other points
What's the difference between 'rename' and 'mv'?
Is it legal for company to use my work email to pretend I still work there?
What to put in ESTA if staying in US for a few days before going on to Canada
Is "remove commented out code" correct English?
Can a virus destroy the BIOS of a modern computer?
Does casting Light, or a similar spell, have any effect when the caster is swallowed by a monster?
Could gravitational lensing be used to protect a spaceship from a laser?
How to say in German "enjoying home comforts"
Anagram holiday
How do conventional missiles fly?
How do I find out when a node was added to an availability group?
Assassin's bullet with mercury
Is the Joker left-handed?
Is there a hemisphere-neutral way of specifying a season?
I would say: "You are another teacher", but she is a woman and I am a man
Why is the ratio of two extensive quantities always intensive?
Why does Kotter return in Welcome Back Kotter
How can I tell someone that I want to be his or her friend?
How much of data wrangling is a data scientist's job?
prove that the matrix A is diagonalizable
Were any external disk drives stacked vertically?
Cronab fails because shell path not found
Plain language with long required phrases
How to take photos in burst mode, without vibration?
networkx shortest path error
How to visualize shortest path that is calculated using Networkx?Shortest Path Analysis - FMENetworkX: Saving Shortest path of OpenStreetMap data as an OGR friendly formatShortest path calculation from shapefile data using GeoTools?How to connect nodes via shortest path along network lines with GRASS v.net modules?Create MultiDiGraph from Shapefile using NetworkxCalculation of fastest path with in network analysis by qgis 3.0Yen's or Eppstein for path with intermediate destinations which are dangling nodesNetworkX - Indexed Spatial node queries?Shortest path between one point to every other points
.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty margin-bottom:0;
I am trying to implement single_source_dijkstra_path algorithm of the networkx to define the shortest path from a node to all nodes in the network. There are six sources in total, and I want to measure which one of the six nodes has the shortest path to a target node (e.g from node 1 - 6, which node has the shortest distance to node 30). While it works, I think some of the result didn't show the shortest path.
for example, the picture above shows the shortest path to AS Calau, which is to be from Stralsund with 353.3 km. However, with only a gap of a node with a distance of 10 km, the shortest path changes as follow:
From Calau to Bronkow is only 10 km and my network is proven to be all connected (len(list(nx.connected_components)) = 1 ). In Figure 2, it can be seen that the shortest path is no longer from Stralsund but from Rostock Oberseehafen, and the shortest distance is then 641 km. Further analysis also shown that from Stralsund to Bronkow needs to undergo similar path with figure 2, thus resulting in a longer distance.
Does anybody know what I might be doing wrong in this case or does anyone have any explanation for this?
shortest-path networkx
edited Apr 1 at 18:46
PolyGeo♦
53.9k1781245
asked Apr 1 at 16:23
botibobotibo
436
add a comment |
I am trying to implement single_source_dijkstra_path algorithm of the networkx to define the shortest path from a node to all nodes in the network. There are six sources in total, and I want to measure which one of the six nodes has the shortest path to a target node (e.g from node 1 - 6, which node has the shortest distance to node 30). While it works, I think some of the result didn't show the shortest path.
for example, the picture above shows the shortest path to AS Calau, which is to be from Stralsund with 353.3 km. However, with only a gap of a node with a distance of 10 km, the shortest path changes as follow:
From Calau to Bronkow is only 10 km and my network is proven to be all connected (len(list(nx.connected_components)) = 1 ). In Figure 2, it can be seen that the shortest path is no longer from Stralsund but from Rostock Oberseehafen, and the shortest distance is then 641 km. Further analysis also shown that from Stralsund to Bronkow needs to undergo similar path with figure 2, thus resulting in a longer distance.
Does anybody know what I might be doing wrong in this case or does anyone have any explanation for this?
shortest-path networkx
edited Apr 1 at 18:46
PolyGeo♦
53.9k1781245
asked Apr 1 at 16:23
botibobotibo
436
1
Everything is connected but not where you think it is. There are missing nodes in your network.
– FelixIP
Apr 1 at 18:21
add a comment |
I am trying to implement single_source_dijkstra_path algorithm of the networkx to define the shortest path from a node to all nodes in the network. There are six sources in total, and I want to measure which one of the six nodes has the shortest path to a target node (e.g from node 1 - 6, which node has the shortest distance to node 30). While it works, I think some of the result didn't show the shortest path.
for example, the picture above shows the shortest path to AS Calau, which is to be from Stralsund with 353.3 km. However, with only a gap of a node with a distance of 10 km, the shortest path changes as follow:
From Calau to Bronkow is only 10 km and my network is proven to be all connected (len(list(nx.connected_components)) = 1 ). In Figure 2, it can be seen that the shortest path is no longer from Stralsund but from Rostock Oberseehafen, and the shortest distance is then 641 km. Further analysis also shown that from Stralsund to Bronkow needs to undergo similar path with figure 2, thus resulting in a longer distance.
Does anybody know what I might be doing wrong in this case or does anyone have any explanation for this?
shortest-path networkx
edited Apr 1 at 18:46
PolyGeo♦
53.9k1781245
asked Apr 1 at 16:23
botibobotibo
436
I am trying to implement single_source_dijkstra_path algorithm of the networkx to define the shortest path from a node to all nodes in the network. There are six sources in total, and I want to measure which one of the six nodes has the shortest path to a target node (e.g from node 1 - 6, which node has the shortest distance to node 30). While it works, I think some of the result didn't show the shortest path.
for example, the picture above shows the shortest path to AS Calau, which is to be from Stralsund with 353.3 km. However, with only a gap of a node with a distance of 10 km, the shortest path changes as follow:
From Calau to Bronkow is only 10 km and my network is proven to be all connected (len(list(nx.connected_components)) = 1 ). In Figure 2, it can be seen that the shortest path is no longer from Stralsund but from Rostock Oberseehafen, and the shortest distance is then 641 km. Further analysis also shown that from Stralsund to Bronkow needs to undergo similar path with figure 2, thus resulting in a longer distance.
Does anybody know what I might be doing wrong in this case or does anyone have any explanation for this?
shortest-path networkx
shortest-path networkx
edited Apr 1 at 18:46
PolyGeo♦
53.9k1781245
asked Apr 1 at 16:23
botibobotibo
436
edited Apr 1 at 18:46
PolyGeo♦
53.9k1781245
asked Apr 1 at 16:23
botibobotibo
436
edited Apr 1 at 18:46
PolyGeo♦
53.9k1781245
edited Apr 1 at 18:46
PolyGeo♦
53.9k1781245
edited Apr 1 at 18:46
PolyGeo♦
53.9k1781245
53.9k1781245
asked Apr 1 at 16:23
botibobotibo
436
asked Apr 1 at 16:23
botibobotibo
436
asked Apr 1 at 16:23
botibobotibo
436
436
1
Everything is connected but not where you think it is. There are missing nodes in your network.
– FelixIP
Apr 1 at 18:21
add a comment |
1
Everything is connected but not where you think it is. There are missing nodes in your network.
– FelixIP
Apr 1 at 18:21
1
1
Everything is connected but not where you think it is. There are missing nodes in your network.
– FelixIP
Apr 1 at 18:21
Everything is connected but not where you think it is. There are missing nodes in your network.
– FelixIP
Apr 1 at 18:21
add a comment |
1 Answer
1
active
oldest
votes
Based upon what @FelixIP said I would check the junctions marked here:
See if they are genuinely snapped or its not a multi-part shape which breaks network topology.
answered 2 days ago
HornbyddHornbydd
27.1k32957
add a comment |
Your Answer
StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "79"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);
else
createEditor();
);
function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);
);
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fgis.stackexchange.com%2fquestions%2f317380%2fnetworkx-shortest-path-error%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
Based upon what @FelixIP said I would check the junctions marked here:
See if they are genuinely snapped or its not a multi-part shape which breaks network topology.
answered 2 days ago
HornbyddHornbydd
27.1k32957
add a comment |
Based upon what @FelixIP said I would check the junctions marked here:
See if they are genuinely snapped or its not a multi-part shape which breaks network topology.
answered 2 days ago
HornbyddHornbydd
27.1k32957
add a comment |
Based upon what @FelixIP said I would check the junctions marked here:
See if they are genuinely snapped or its not a multi-part shape which breaks network topology.
answered 2 days ago
HornbyddHornbydd
27.1k32957
Based upon what @FelixIP said I would check the junctions marked here:
See if they are genuinely snapped or its not a multi-part shape which breaks network topology.
answered 2 days ago
HornbyddHornbydd
27.1k32957
answered 2 days ago
HornbyddHornbydd
27.1k32957
answered 2 days ago
HornbyddHornbydd
27.1k32957
answered 2 days ago
HornbyddHornbydd
27.1k32957
27.1k32957
add a comment |
add a comment |
Thanks for contributing an answer to Geographic Information Systems Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fgis.stackexchange.com%2fquestions%2f317380%2fnetworkx-shortest-path-error%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
1
Everything is connected but not where you think it is. There are missing nodes in your network.
– FelixIP
Apr 1 at 18:21