Beefy Boxes and Bandwidth Generously Provided by pair Networks
XP is just a number
 
PerlMonks  

Re: Is this a valid approach to finding if a path through a set of points has completed?

by tobyink (Canon)
on Jul 16, 2018 at 08:39 UTC ( #1218542=note: print w/replies, xml ) Need Help??


in reply to Is this a valid approach to finding if a path through a set of points has completed?

So putting it in graph theory terms, you're looking for graphs where there exists a path that allows you to visit all the nodes and return to your starting point while only traversing each edge at most once?

I'm not sure from your examples whether the edges are directed (i.e. only allowed to be followed in one particular direction).

If I were trying to solve this problem, I'd start with Graph or Graph::Easy.

  • Comment on Re: Is this a valid approach to finding if a path through a set of points has completed?

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1218542]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others pondering the Monastery: (5)
As of 2021-05-18 10:14 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    Perl 7 will be out ...





    Results (178 votes). Check out past polls.

    Notices?