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'
[download]

I could always just use brute force, but there has to be a more elegant solution.
Any thoughts?