Beefy Boxes and Bandwidth Generously Provided by pair Networks
Your skill will accomplish
what the force of many cannot
 
PerlMonks  

Re^2: Graph in a terminal (ASCII - art)

by johngg (Canon)
on Feb 13, 2018 at 18:15 UTC ( #1209080=note: print w/replies, xml ) Need Help??


in reply to Re: Graph in a terminal (ASCII - art)
in thread Graph in a terminal (ASCII - art)

Thanks for the pointer the Graph::Easy, I'd not seen that before so just installed it. I'd already created a hash of edges from an AoA of the events but had no idea how to turn them into a graph as I don't have a computer science background. Once I had the module I initialised a graph and added the edges from the hash and printed the result. My output differs from yours in that you have two 1 -> 2 edges where I only have one. Reading the module documentation it may be that you did $graph->add_edge(1,2) twice, although it only appears once in the code you posted.

use strict; use warnings; use 5.022; use Graph::Easy; say qq{Using Graph::Easy version $Graph::Easy::VERSION}; my @events = ( [ 1, 2, 5, 6, 7, 8, 9, 11 ], [ 1, 2, 5, 6, 7, 8, 10, 11 ], [ 1, 4, 5, 6, 7, 8, 9, 11 ], [ 1, 4, 5, 6, 7, 8, 10, 11 ], [ 1, 3, 5, 6, 7, 8, 9, 11 ], [ 1, 3, 5, 6, 7, 8, 10, 11 ], [ 1, 7, 8, 10, 11 ], ); my %edges; foreach my $event ( @events ) { foreach my $idx ( 1 .. $#{ $event } ) { $edges{ join q{ -> }, $event->[ $idx - 1 ], $event->[ $idx ] } + ++; } } say for map { unpack q{x8a*} } sort map { pack q{NNa*}, split( m{ -> } ), $_ } keys %edges; my $graph = Graph::Easy->new(); $graph->add_edge( split m{ -> } ) for keys %edges; print $graph->as_ascii();

The output.

Using Graph::Easy version 0.76 1 -> 2 1 -> 3 1 -> 4 1 -> 7 2 -> 5 3 -> 5 4 -> 5 5 -> 6 6 -> 7 7 -> 8 8 -> 9 8 -> 10 9 -> 11 10 -> 11 +-----------------------------+ | | | | | +-------------------+-------------------+ | | v v +---+ +---+ +---+ +---+ +---+ +---+ +---+ ++----+ +----+ | 4 | <-- | 1 | --> | 2 | --> | 5 | --> | 6 | --> | 7 | --> | 8 | --> +| 10 | --> | 11 | +---+ +---+ +---+ +---+ +---+ +---+ +---+ ++----+ +----+ | ^ | + ^ | | | + | v | v + | +---+ | +---+ + | | 3 | ----------------+ | 9 | ---- +-------------+ +---+ +---+

If I change the graphing code to this I get output that matches yours.

... my $graph = Graph::Easy->new(); $graph->add_edge( split m{ -> } ) for keys %edges; $graph->add_edge( 1, 2 ); print $graph->as_ascii();

I hope this is of interest.

Cheers,

JohnGG

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others taking refuge in the Monastery: (2)
As of 2023-09-27 04:57 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found

    Notices?