Beefy Boxes and Bandwidth Generously Provided by pair Networks
Don't ask to ask, just ask
 
PerlMonks  

Re: Paths::Graph use

by Khen1950fx (Canon)
on Aug 22, 2012 at 03:57 UTC ( #988942=note: print w/ replies, xml ) Need Help??


in reply to Paths::Graph use

Paths::Graph has a debug method that runs the gamut of the entire algorithm. Here's an example:

#!/usr/bin/perl BEGIN { $| = 1; $^W = 1; } use autodie; use strictures 1; my %graph = ( A => { B => '10.0.0.128', C => '10.0.0.132', G => '10.0.0.129', }, C => { A => '10.0.0.135', B => '10.0.0.128', F => '10.0.0.134', }, ); use Paths::Graph; use strict qw/refs/; use warnings FATAL => 'syntax'; my $obj = Paths::Graph->new( -origin => "A", -destiny => "B", -graph => \%graph, ); $obj->debug(); my @paths = $obj->shortest_path(); foreach my $path (@paths) { print "Shortest Path:" . join( "->", @{$path} ) . " Cost:" . $obj->get_path_cost( @{$path} ); print "\n"; }
Please note that your use of @${path} is incorrect. The correct way is @{$path}.


Comment on Re: Paths::Graph use
Select or Download Code

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others perusing the Monastery: (5)
As of 2014-07-23 23:39 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    My favorite superfluous repetitious redundant duplicative phrase is:









    Results (154 votes), past polls