#!/usr/bin/perl

use Boost::Graph;
my $graph = new Boost::Graph(directed=>0, net_name=>'Graph Name', net_id=>1000); 

# add edges
$graph->add_edge(node1=>'1', node2=>'2', weight=>1);
$graph->add_edge(node1=>'1', node2=>'3', weight=>1);
$graph->add_edge(node1=>'2', node2=>'4', weight=>1);
$graph->add_edge(node1=>'3', node2=>'4', weight=>1);
my $path=$graph->dijkstra_shortest_path('1','4');

print @{$path->{'path'}};