1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
|
#!/usr/bin/perl
use strict;
use warnings;
use Graph::MoreUtils qw( line );
use Graph::Undirected;
use Test::More tests => 13;
my( $g, $l, @edges );
# Path of three vertices, one edge has an attribute
$g = Graph::Undirected->new;
$g->add_edges( [ 'A', 'B' ], [ 'B', 'C' ] );
$g->set_edge_attribute( 'A', 'B', 'color', 'red' );
$l = line( $g );
is( $l->vertices, 2 );
is( $l->edges, 1 );
is( (grep { defined $_->{color} && $_->{color} eq 'red' } $l->vertices), 1 );
@edges = $l->edges;
is( $l->get_edge_attribute( @{$edges[0]}, 'original_vertex' ), 'B' );
$l = line( $g, { loop_end_vertices => 1 } );
is( $l->vertices, 4 );
is( $l->edges, 3 );
@edges = $l->edges;
is( join( ',', sort map { $l->get_edge_attribute( @$_, 'original_vertex' ) }
$l->edges ),
'A,B,C' );
# Two vertices with two parallel edges
$g = Graph::Undirected->new( multiedged => 1 );
$g->add_edges( [ 'A', 'B' ], [ 'A', 'B' ] );
$l = line( $g );
is( $l->vertices, 2 );
is( $l->edges, 1 );
$l = line( $g, { loop_end_vertices => 1 } );
is( $l->vertices, 2 );
is( $l->edges, 1 );
# Single vertex with three self-loops
$g = Graph::Undirected->new( multiedged => 1 );
$g->add_edges( [ 'A', 'A' ], [ 'A', 'A' ], [ 'A', 'A' ] );
$l = line( $g );
is( $l->vertices, 3 );
is( $l->edges, 3 );
|
