Skip Menu |

This queue is for tickets about the Graph-Easy CPAN distribution.

Report information
The Basics
Id: 51005
Status: open
Priority: 0/
Queue: Graph-Easy

People
Owner: Nobody in particular
Requestors: bwagner [...] cpan.org
Cc: dmcbride [...] cpan.org
AdminCc:

Bug Information
Severity: (no value)
Broken in: (no value)
Fixed in: (no value)



Subject: Layouter failed to place 5 edges in simple 3 node graph
This simple graph: digraph { 0 -> 1 0 -> 2 1 -> 0 2 -> 1 2 -> 2 } caused warning: "Warning: Layouter could only place 3 nodes/4 edges out of 3/5 - giving up at /usr/local/bin/graph-easy line 147" and resulted in missing edge "2 -> 2": +---+ +> | 0 | -+ | +---+ | | | | | | | | v | | +---+ | | | 2 | | | +---+ | | | | | | | | v | | +---+ | +- | 1 | <+ +---+ When omitting one of the edges 0 -> 1 or 1 -> 0, the layouter succeeds. Thank you Bernhard
On Sat Oct 31 13:14:03 2009, BWAGNER wrote: Show quoted text
> This simple graph: > > digraph { > 0 -> 1 > 0 -> 2 > 1 -> 0 > 2 -> 1 > 2 -> 2 > } > > caused warning: > "Warning: Layouter could only place 3 nodes/4 edges out of 3/5 - giving > up at /usr/local/bin/graph-easy line 147" > > and resulted in missing edge "2 -> 2": > > +---+ > +> | 0 | -+ > | +---+ | > | | | > | | | > | v | > | +---+ | > | | 2 | | > | +---+ | > | | | > | | | > | v | > | +---+ | > +- | 1 | <+ > +---+ > > When omitting one of the edges 0 -> 1 or 1 -> 0, the layouter succeeds. > Thank you > Bernhard
Hi! Thanks for the report and sorry for the late response. I can reproduce it now, but since it appears that solving this bug will involve some complexity I'm delaying solving it to later on. Regards, -- Shlomi Fish
On Fri May 28 16:17:18 2010, SHLOMIF wrote: I'm hoping you've had time to look at this, because I have a much more complex one which is missing an edge. (B->D seems missing.) This example is a real example, other than changing the names. Lengths are kept the same, because if I change the names to one-letter names, then it works. I'd try to take a look myself, but G::E's code isn't nearly as easy as its API :- )
Subject: ge.pl
#!/usr/bin/perl use Graph::Easy; my $g = Graph::Easy->new(); my $st=Graph::Easy::Node->new('ZZZZZZ START'); my $end=Graph::Easy::Node->new('ZZZZZZ END'); my $A = Graph::Easy::Node->new('AAAAAAAAAAA'); my $B = Graph::Easy::Node->new('BBBBBB'); my $C = Graph::Easy::Node->new('CCCCCCCCCCCCCCCCCCC'); my $D = Graph::Easy::Node->new('DDDDDDDDDDDD'); my $E = Graph::Easy::Node->new('EEEEEEEEEEEEEEEE'); my $F = Graph::Easy::Node->new('FFFFFFFFFFFFFFFFFFFFFFFF'); my $G = Graph::Easy::Node->new('GGGGGGGGGGGGGGGGGGGGGGGG'); my $H = Graph::Easy::Node->new('HHHHHHHHHHHHHH'); my $I = Graph::Easy::Node->new('IIIIIIIIIIIIIIIII'); my $J = Graph::Easy::Node->new('JJJJJ'); my $K = Graph::Easy::Node->new('KKKKKKK'); $g->add_edge($E, $F); $g->add_edge($A, $F); $g->add_edge($B, $F); $g->add_edge($H, $J); $g->add_edge($I, $J); $g->add_edge($A, $G); $g->add_edge($B, $G); $g->add_edge($A, $D); $g->add_edge($B, $D); $g->add_edge($A, $E); $g->add_edge($C, $E); $g->add_edge($D, $E); $g->add_edge($B, $E); $g->add_edge($F, $H); $g->add_edge($A, $H); $g->add_edge($G, $H); $g->add_edge($D, $H); $g->add_edge($B, $H); $g->add_edge($st, $A); $g->add_edge($H, $K); $g->add_edge($J, $K); $g->add_edge($st, $C); $g->add_edge($H, $I); $g->add_edge($st, $B); $g->add_edge(K,$end); binmode STDOUT, ':utf8'; print $g->as_boxart_file();