Beefy Boxes and Bandwidth Generously Provided by pair Networks
Think about Loose Coupling
 
PerlMonks  

Re^3: Travelling problem

by Dirk80 (Monk)
on Dec 22, 2013 at 20:55 UTC ( #1068120=note: print w/replies, xml ) Need Help??


in reply to Re^2: Travelling problem
in thread Travelling problem

I tried the Graph module. I had a deep look at the SPT_Dijkstra algorithm and tried it with some sample data.

I think that I now understand the algorithm. It takes a start vertex and the result are the paths from the start vertex to all other vertices.

But this is not what I need. I need only one path from the start to the end which takes all vertices between into account.

I see no way how to solve my problem with the graph module. Or do I see something wrong? I'll now try another way. Nevertheless thank you. It was interesting to play with this Graph module.

Update:

The Graph module does not seem to be the problem, but my lack of knowledge about graph algorithms. I'm reading now about these algorithms. When I understood them, then I'll start my implementation.

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1068120]
help
Chatterbox?
and the questions are moot...

How do I use this? | Other CB clients
Other Users?
Others making s'mores by the fire in the courtyard of the Monastery: (8)
As of 2017-01-22 00:45 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    Do you watch meteor showers?




    Results (186 votes). Check out past polls.