Skip to main content
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index] [List Home]
Re: [sumo-user] Using Dijkstra
  • From: Michael Behrisch <oss@xxxxxxxxxxx>
  • Date: Sun, 15 Sep 2019 21:05:43 +0200
  • Autocrypt: addr=oss@xxxxxxxxxxx; prefer-encrypt=mutual; keydata= mQGiBFLSvucRBACGsasS4GeIWs1CFNTOYmp3ScQ2ZTJLJWQxhPliwtHTzLsErYu9Y7e8qDov iHFviYyaNuceUNoACm1e4MT4eu0DmM2Wk3y/jjD6hfm7L0EZNPxQhj+CJf2oZAm2ezCe7/si xZ2d7TCO8yWavOGbF0EVi/ZDIJqVgupu6WBpv/NCewCg65HQiS1wm+1w1MdFYxKCmXzbv08D /iWXX3tzabbCrLlUum8hBgBpJEHRtlic2uaGsKm8Fize4tfLZkTBbTYLYXfcx2Oq9+lINPTW h9jnbCjAjErRWLTjNTQjel0JnDryCnqabub/R3wScR/EHRDBeS9L6YRj0xdVd2qIaArtSYRR auKPNc4M2qZNEFSM37cXC7avhpdeA/99oJf4qyVly4RxHmekAmj9UJjRx17x9xX8t9uzUuSt AeTh+kQ3o5jK7veU6/F/+pPyi96EOzym9BJA8pgXC8hLWNjOajI10filkdQ26QsfHOpUdPSZ 4Duyw9Ayj8loagEnnAONmU/xE0QlyVBANIut0W+SNqPScYXfnBbVOaG3HbQiTWljaGFlbCBC ZWhyaXNjaCA8b3NzQGJlaHJpc2NoLmRlPohjBBMRAgAjBQJS0sHSAhsjBwsJCAcDAgEGFQgC CQoLBBYCAwECHgECF4AACgkQPBD+ltFwpimlmQCdGgnYuHxoye4vFntyHRcE0Ij0318AoN3s szGyKcKdUmPpgXLhFcNfRGe4uQENBFLSvucQBACRAt3OW7eL8N3OJp2bZz/rRldtxjcViEcd +wpQcL9Ag0b6W7e4cbSc9oSU9MAdOvxR0UxualeRGz37W/VEC8cFZb3kFtRdl66gGygKb7gl 2S27495XEYqE7BBF1HfQDjL9sh5GfuIzORkqhCHSUTdkRuzRPxNQcEYFSrASEi9jQwADBQP9 FeuTC1SJHrX9tP3p4xrEa07XkCq+UzwNhDdezoQfT1CUbOv+LT66yLTXAaiHXelgaPMQO1Oo 76U2z0C1LudkAcDdwJbMuZ0RfDoRjsgfhfvM6kqiP4m0s2NR3Y3O+HKXjwtPbXuDwaYIAIvp aj8b59n7fQyfL6BZsO0QZc0i/t+ISQQYEQIACQUCUtK+5wIbDAAKCRA8EP6W0XCmKY1lAKCc 3miJueOXuvZJWV7qGBQxxyR83gCgxhGPL9OrP22rxNJSo1w5OOUxHsM=
  • Delivered-to: sumo-user@xxxxxxxxxxx
  • List-archive: <https://www.eclipse.org/mailman/private/sumo-user>
  • List-help: <mailto:sumo-user-request@eclipse.org?subject=help>
  • List-subscribe: <https://www.eclipse.org/mailman/listinfo/sumo-user>, <mailto:sumo-user-request@eclipse.org?subject=subscribe>
  • List-unsubscribe: <https://www.eclipse.org/mailman/options/sumo-user>, <mailto:sumo-user-request@eclipse.org?subject=unsubscribe>
  • Openpgp: preference=signencrypt
  • User-agent: Mozilla/5.0 (X11; Linux x86_64; rv:60.0) Gecko/20100101 Thunderbird/60.8.0
Hi,
just for the record: There is also a Dijkstra implementation in
sumolib.net.Net.getShortestPath.

Best regards,
Michael

Am 12.09.19 um 21:16 schrieb Raheleh Zarei:
> Thank you Jakob.
> How can I write my own python code using tracI and sumo libraries, and
> when the SUMO run, in my my python code, I should be able to debug SUMO
> source code?
> I already use visual studio, to debug the sumo source code and trace it,
> now I need to be able to trace the source code, when I use for example
> traci.simulation.findRoute in my python script.
> Thanks for your time and help.
> 
> Best,
> 
> 
> On Mon, Sep 9, 2019 at 3:30 AM Jakob Erdmann <namdre.sumo@xxxxxxxxx
> <mailto:namdre.sumo@xxxxxxxxx>> wrote:
> 
>     traci.simulation.findRoute uses sumo functionality implemented in
>     the C++ core.
>     However, you can use python functions to affect the edge weights
>     (traveltimes) that are used to find the fastest route.
>     See
>     https://sumo.dlr.de/wiki/Simulation/Routing#Travel-time_values_for_routing
> 
>     Am Do., 5. Sept. 2019 um 03:29 Uhr schrieb Raheleh Zarei
>     <raheleh.zarei@xxxxxxxxx <mailto:raheleh.zarei@xxxxxxxxx>>:
> 
>         Thanks for your reply.
>         Can I customize  the code behind traci.simulation.findRoute in
>         my python code?
> 
>         Thanks
> 
>         On Wed, Sep 4, 2019 at 1:56 PM Jakob Erdmann
>         <namdre.sumo@xxxxxxxxx <mailto:namdre.sumo@xxxxxxxxx>> wrote:
> 
>             The dijstra.py module is not actively developed or tested
>             anymore. I canot vouch for its usefulnes.
>             if you want to find shortest paths on a sumo network you can
>             use traci.simulation.findRoute
> 
>             Am Di., 3. Sept. 2019 um 23:39 Uhr schrieb Raheleh Zarei
>             <raheleh.zarei@xxxxxxxxx <mailto:raheleh.zarei@xxxxxxxxx>>:
> 
>                 Hello
> 
>                 I am writing a program in python, using TracI to
>                 connecto to SUMO simulation data. I need to use the
>                 Dijkstra algorithm for my program. I want to know if I
>                 can use the Dijkstra,py in tools folder of  SUMO? How
>                 can I call this script and use its functions?
> 
>                 Thank you
> 
>                 -- 
>                 *RAZ*
>                 _______________________________________________
>                 sumo-user mailing list
>                 sumo-user@xxxxxxxxxxx <mailto:sumo-user@xxxxxxxxxxx>
>                 To change your delivery options, retrieve your password,
>                 or unsubscribe from this list, visit
>                 https://www.eclipse.org/mailman/listinfo/sumo-user
> 
>             _______________________________________________
>             sumo-user mailing list
>             sumo-user@xxxxxxxxxxx <mailto:sumo-user@xxxxxxxxxxx>
>             To change your delivery options, retrieve your password, or
>             unsubscribe from this list, visit
>             https://www.eclipse.org/mailman/listinfo/sumo-user
> 
> 
> 
>         -- 
>         *RAZ*
>         _______________________________________________
>         sumo-user mailing list
>         sumo-user@xxxxxxxxxxx <mailto:sumo-user@xxxxxxxxxxx>
>         To change your delivery options, retrieve your password, or
>         unsubscribe from this list, visit
>         https://www.eclipse.org/mailman/listinfo/sumo-user
> 
>     _______________________________________________
>     sumo-user mailing list
>     sumo-user@xxxxxxxxxxx <mailto:sumo-user@xxxxxxxxxxx>
>     To change your delivery options, retrieve your password, or
>     unsubscribe from this list, visit
>     https://www.eclipse.org/mailman/listinfo/sumo-user
> 
> 
> 
> -- 
> *RAZ*
> 
> _______________________________________________
> sumo-user mailing list
> sumo-user@xxxxxxxxxxx
> To change your delivery options, retrieve your password, or unsubscribe from this list, visit
> https://www.eclipse.org/mailman/listinfo/sumo-user
>

Attachment: signature.asc
Description: OpenPGP digital signature

Back to the top