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
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
|
use Test::More tests => 36;
use Graph;
my $g = Graph->new;
$g->add_vertex("a");
$g->add_vertex("b");
ok( $g->delete_vertex("b") );
ok( $g->has_vertex("a") );
ok( ! $g->has_vertex("b") );
ok( ! $g->has_vertex("c") );
ok( $g->delete_vertex("c") );
ok( $g->has_vertex("a") );
ok( ! $g->has_vertex("b") );
ok( ! $g->has_vertex("c") );
is( $g->delete_vertex("a"), "" );
is( $g->delete_vertex("a"), "" );
$g->add_vertices(qw(a b c d));
ok( $g->has_vertex("a") );
ok( $g->has_vertex("b") );
ok( $g->has_vertex("c") );
ok( $g->has_vertex("d") );
$g->delete_vertices(qw(a c));
ok( ! $g->has_vertex("a") );
ok( $g->has_vertex("b") );
ok( ! $g->has_vertex("c") );
ok( $g->has_vertex("d") );
$g->delete_vertices(qw(a c));
ok( ! $g->has_vertex("a") );
ok( $g->has_vertex("b") );
ok( ! $g->has_vertex("c") );
ok( $g->has_vertex("d") );
$g->delete_vertices(qw(b d));
ok( ! $g->has_vertex("a") );
ok( ! $g->has_vertex("b") );
ok( ! $g->has_vertex("c") );
ok( ! $g->has_vertex("d") );
is( $g->delete_vertex(), $g );
is( $g->delete_vertices(), $g );
my $h = Graph->new(countvertexed => 1);
$h->add_vertices(qw(a a b b));
ok( $h->has_vertex("a") );
ok( $h->has_vertex("b") );
$h->delete_vertex('a');
ok( $h->has_vertex("a") );
$h->delete_vertex('a');
ok( ! $h->has_vertex("a") );
$h->delete_vertices('b');
ok( $h->has_vertices("b") );
$h->delete_vertices('b');
ok( ! $h->has_vertices("b") );
{
# From Andras Salamon
use Graph::Directed;
my $f = new Graph::Directed;
$f->add_edges( qw( a a a b ) ); # notice self-loop
is($f, "a-a,a-b");
$f->delete_vertex('a');
is($f, "b");
}
|
