I'm wondering if anyone has some suggestions on how to accomplish this. I have a data structure mocked up below that represents connections between two nodes. I'm trying to create an algorithm that given a starting and ending IP will find one path. This is a lot like the traveling salesman problem. The data structure is simply a representaion of the data so I can alter it in any way that might make this problem easier.
#!C:/perl/bin/perl.exe
use strict;
use warnings;
my $start = '1.2.3.4';
my $end = '1.2.3.6';
my %network = (
'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'
);
one path is:
'1.2.3.4 links with 1.2.3.5'
'1.2.3.5 links with 1.2.3.6'
I could always just use brute force, but there has to be a more elegant solution.
Any thoughts?
-
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.
|