Timeline for Shortest path touching all points
Current License: CC BY-SA 4.0
22 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 26, 2022 at 3:49 | vote | accept | rmj | ||
| Jul 15, 2022 at 11:06 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Mar 1, 2022 at 1:01 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Jan 14, 2022 at 18:00 | history | tweeted | twitter.com/StackGIS/status/1482049923235385347 | ||
| Jan 14, 2022 at 11:41 | comment | added | rmj | @FelixIP I am not sure about the mixing of spanning tree and shortest distance. However, I have updated the question and added another image, from which you could understand what do I expect as an outcome. Thanks | |
| Jan 14, 2022 at 11:36 | history | edited | rmj | CC BY-SA 4.0 |
added 136 characters in body
|
| S Jan 14, 2022 at 11:26 | history | edited | rmj | CC BY-SA 4.0 |
Got an easy solution. But it is not usable yet!
|
| Jan 14, 2022 at 11:10 | review | Suggested edits | |||
| S Jan 14, 2022 at 11:26 | |||||
| Jan 14, 2022 at 2:35 | comment | added | FelixIP | I think you are mixing up minimum spanning tree and shortest distance. Perhaps change 2nd picture to show how would you like right-most 3 points to be connected. | |
| Jan 14, 2022 at 1:58 | comment | added | rmj | @FelixIP Second image is not correct because it travels from the left to right touching all the points on the bottom and comes back to the origin (left) touching all points on top. Thus, it takes a double route. It is like that because TSP was meant to be reaching back to the origin. If u look closer, the point on top (points touching while coming back) are actually near to points touching while going to the right. Hence, in this case, it takes a double route almost. | |
| Jan 13, 2022 at 19:19 | comment | added | FelixIP | Try with minimum number of points (7 ?) and use permutations with fixed 1st point. Compare route to one produced by TCP. For now you have no proof that it is not working. The one on 2nd picture looks correct to me | |
| Jan 13, 2022 at 14:04 | comment | added | rmj | Hi @BERA, I might be wrong, but as much I understand from networkx library, those functions are made to identify the best route from A to B, ignoring all unwanted nodes. In that route, most nodes are ignored to get the least cost path. I wanted a route that touches all the nodes, which I could not find in networkx library. Pls correct me if I am wrong. Thank you | |
| Jan 13, 2022 at 12:51 | comment | added | rmj |
@BERA Thaks for the response. I have tried the minimum_spanning_edges function but it only gives weights between the points such as 1, 28, {'weight': 4}), 20, 46, {'weight': 21}). However, the library seems promising. I tried a few ways and failed. Now I am trying to understand the functions and also I have tried their google group for an answer. Let me come back to you if I could derive a solution.
|
|
| Jan 13, 2022 at 11:25 | answer | added | ThomasJ | timeline score: 0 | |
| Jan 13, 2022 at 10:48 | answer | added | wfgeo | timeline score: 1 | |
| Jan 13, 2022 at 10:35 | history | edited | PolyGeo♦ | CC BY-SA 4.0 |
deleted 21 characters in body
|
| Jan 13, 2022 at 9:40 | history | edited | rmj | CC BY-SA 4.0 |
added 103 characters in body
|
| Jan 13, 2022 at 9:35 | comment | added | rmj | Thanks for the response @IanTurton. I have tried that already. A sample of that is added in the description for reference. | |
| Jan 13, 2022 at 9:32 | history | edited | rmj | CC BY-SA 4.0 |
added 204 characters in body
|
| Jan 13, 2022 at 8:59 | comment | added | Ian Turton | can you not just use the TSP result with the last link removed? | |
| S Jan 13, 2022 at 7:01 | review | First questions | |||
| Jan 13, 2022 at 7:20 | |||||
| S Jan 13, 2022 at 7:01 | history | asked | rmj | CC BY-SA 4.0 |