Just FYI, this isn't much like the
Travelling Salesman Problem (or TSP) as that requires a path that visits every node in the network, usually for a minimum cost (there are many variations, such as using each link only once, etc.) which is probably not what you are after. In any case you should find some valuable tools on the CPAN in
Graph as
Fletch advises.
Update: Graph is not so complicated, though you could argue it is overkill for this simple example:
use strict;
use warnings;
use Graph;
my $net = Graph::Undirected->new; # links go both ways
my $start = '1.2.3.4';
my $end = '1.2.3.6';
while(<DATA>) {
chomp(my($from,$to) = (split /\s+[^\d.]+\s+/)[0,1]);
if($net->has_edge($from,$to) ) {
print "duplication of $from to $to\n"; # shows Graph understands u
+ndirected links
}else{
$net->add_edge($from, $to);
print "link from $from to $to added\n";
}
}
print "the nodes are: ", join(', ', sort $net->vertices), "\n";
print "the links are: ",$net, "\n";
print "a shortest path from $start to $end is: ", join ' => ', $net->S
+P_Dijkstra($start,$end);
__DATA__
1.2.3.4 links with 1.2.3.5
1.2.3.5 links with 1.2.3.4
1.2.3.5 links with 1.2.3.6
1.2.3.6 links with 1.2.3.5
1.2.3.6 links with 1.2.3.7
1.2.3.7 links with 1.2.3.6
1.2.3.7 links with 1.2.3.4
1.2.3.4 links with 1.2.3.7
1.2.3.5 links with 1.2.3.7
1.2.3.7 links with 1.2.3.5
produces:
link from 1.2.3.4 to 1.2.3.5 added
duplication of 1.2.3.5 to 1.2.3.4
link from 1.2.3.5 to 1.2.3.6 added
duplication of 1.2.3.6 to 1.2.3.5
link from 1.2.3.6 to 1.2.3.7 added
duplication of 1.2.3.7 to 1.2.3.6
link from 1.2.3.7 to 1.2.3.4 added
duplication of 1.2.3.4 to 1.2.3.7
link from 1.2.3.5 to 1.2.3.7 added
duplication of 1.2.3.7 to 1.2.3.5
the nodes are: 1.2.3.4, 1.2.3.5, 1.2.3.6, 1.2.3.7
the links are: 1.2.3.4=1.2.3.5,1.2.3.4=1.2.3.7,1.2.3.5=1.2.3.6,1.2.3.5
+=1.2.3.7,1.2.3.6=1.2.3.7
a shortest path from 1.2.3.4 to 1.2.3.6 is: 1.2.3.4 => 1.2.3.7 => 1.2.
+3.6
--
I'd like to be able to assign to an luser
-
Are you posting in the right place? Check out Where do I post X? to know for sure.
-
Posts may use any of the Perl Monks Approved HTML tags. Currently these include the following:
<code> <a> <b> <big>
<blockquote> <br /> <dd>
<dl> <dt> <em> <font>
<h1> <h2> <h3> <h4>
<h5> <h6> <hr /> <i>
<li> <nbsp> <ol> <p>
<small> <strike> <strong>
<sub> <sup> <table>
<td> <th> <tr> <tt>
<u> <ul>
-
Snippets of code should be wrapped in
<code> tags not
<pre> tags. In fact, <pre>
tags should generally be avoided. If they must
be used, extreme care should be
taken to ensure that their contents do not
have long lines (<70 chars), in order to prevent
horizontal scrolling (and possible janitor
intervention).
-
Want more info? How to link
or How to display code and escape characters
are good places to start.