-
Notifications
You must be signed in to change notification settings - Fork 4
/
Graph.pm
278 lines (253 loc) · 6.06 KB
/
Graph.pm
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
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
#: re/Graph.pm
#: Graph data structures used by re::NFA and such
#: Copyright (c) 2006 Agent Zhang
#: 2006-05-15 2006-06-30
package re;
our $eps;
sub eps {
\$eps;
}
package re::Graph;
use strict;
use warnings;
use Carp qw( croak carp );
use GraphViz;
#use Encode 'decode';
#use Data::Dumper::Simple;
use Perl6::Attributes;
use List::MoreUtils 'uniq';
use Text::Table;
sub new {
my $proto = shift;
my $class = ref $proto || $proto;
my $self = bless {
node_to => {},
entry => undef,
exit => [],
}, $class;
if (@_) {
#warn "@_";
./add_edge(@_);
./entry( $_[0] );
./exit( $_[2] );
}
$self;
}
sub merge {
my ($self, $other) = @_;
carp('Oh, dear!') if ! $other;
my $new = bless {
node_to => { %.node_to, %{$other->{node_to}} },
entry => undef,
exit => undef,
}, ref $self;
$new;
}
sub entry {
my $self = shift;
if (@_) {
my $node = shift;
$.node_to{$node} ||= [];
$.entry = $node;
}
else { $.entry; }
}
sub exit {
my $self = shift;
if (@_) {
for my $node (@_) {
$.node_to{$node} ||= [];
}
@.exit = @_;
}
else { wantarray ? @.exit : $.exit[0]; }
}
sub add_exit {
my ($self, $node) = @_;
$.exit ||= [];
$.node_to{$node} ||= [];
push @.exit, $node;
}
sub is_exit {
my ($self, $node) = @_;
for my $exit (@.exit) {
return 1 if $exit eq $node;
}
return undef;
}
sub nodes {
my $self = shift;
keys %.node_to;
}
sub node2edges {
my ($self, $node) = @_;
#warn Dumper($self, $node);
my $edges = $.node_to{$node};
#warn Dumper($node, $edges);
if ($edges) {
return @$edges;
} else {
return ();
}
}
# returns all the weight of edges:
sub weight_list {
my $self = shift;
my @w;
for my $node (./nodes) {
my @edges = ./node2edges($node);
for my $edge (@edges) {
push @w, $edge->[0];
}
}
@w = uniq @w;
wantarray ? @w : \@w;
}
# return the next node of the given node with the weight
sub next_node {
my ($self, $node, $w) = @_;
for my $e (./node2edges($node)) {
if ($e->[0] eq $w) {
return $e->[1];
}
}
undef;
}
sub add_edge {
my ($self, $node1, $weight, $node2) = @_;
my $edge = [ $weight, $node2 ];
#push @.edges, $edge;
$.node_to{$node1} ||= [];
$.node_to{$node2} ||= [];
push @{ $.node_to{$node1} }, $edge;
}
sub visualize {
my ($self, $gv) = @_;
my @nodes = ./nodes;
for my $node (@nodes) {
my @edges = ./node2edges($node);
for my $edge (@edges) {
my $weight = $edge->[0];
$weight = "\x{3b5}" if $weight eq re::eps();
$gv->add_edge($node => $edge->[1], label => " $weight ");
}
}
$gv;
}
sub as_graphviz {
my $self = shift;
my %opts = @_;
my $gv;
if (!%opts) {
$gv = $self->{graphviz};
return $gv if $gv;
}
$opts{font} ||= 'simsun.ttc';
$opts{layout} ||= 'dot';
$opts{node} ||= {
shape => 'circle',
style => 'filled',
fillcolor => 'yellow',
};
$opts{edge} ||= { color => 'red' },
$gv = GraphViz->new(%opts);
$self->visualize($gv);
$gv->add_node(
'-1',
label => ' ',
shape => 'plaintext',
fillcolor => 'white',
height => 0,
width => 0,
);
$gv->add_edge('-1' => $self->entry);
for my $exit ($self->exit) {
$gv->add_node($exit, shape => 'doublecircle');
}
$self->{graphviz} = $gv;
$gv;
}
sub as_png {
my $self = shift;
my $gv = $self->as_graphviz;
$gv->as_png(@_);
}
sub as_dot {
my $self = shift;
my $gv = $self->as_graphviz;
$gv->as_dot(@_);
}
sub build {
my $self = shift;
my $src = shift;
open my $in, '<', \$src;
local $/ = "\n";
my $g = $self->new;
while (<$in>) {
next if /^\s*$/;
if (/^\s* entry \s* : \s* (\S+)/x) {
$g->entry($1);
} elsif (/^\s* exit \s* : \s* (\S+)/x) {
my $s = $1;
my @exits = split /\s*,\s*/, $s;
$g->exit(@exits);
} elsif (/^\s* (\S+) \s* , \s* (\S+) \s* : \s* (\S+)/x) {
my ($a, $b, $w) = ($1, $2, $3);
$w = re::eps if $w eq 'eps';
$g->add_edge($a, $w, $b);
} else {
chomp;
croak "build: Syntax error: $_";
}
}
$g;
}
sub normalize {
my $self = shift;
my $new_g = $self->new;
my $c = 0;
my $entry = $self->entry;
$new_g->entry(1);
my @queue = $entry;
my %visited = ($entry => ++$c);;
while (@queue) {
my $node = shift @queue;
my $node_id = $visited{$node};
if ($self->is_exit($node)) {
$new_g->add_exit($node_id);
}
my @edges = $self->node2edges($node);
@edges = sort { $a->[0] cmp $b->[0] } @edges;
for my $edge (@edges) {
my $child = $edge->[1];
if (! $visited{$child}) {
$visited{$child} = ++$c;
push @queue, $child;
}
my $child_id = $visited{$child};
$new_g->add_edge($node_id, $edge->[0], $child_id);
}
}
$new_g;
}
sub as_table {
my $self = shift;
my @chars = ./weight_list;
#warn '[', join('*', @chars), "]\n";
my @states = ./nodes;
my $tb = Text::Table->new(
'State', @chars,
);
for my $state (sort @states) {
#warn "state: $state\n";
my @trans;
for my $char (@chars) {
my $trans = ./next_node($state, $char);
if (!defined $trans) { $trans = '' }
push @trans, $trans;
}
$tb->add($state, @trans);
}
$tb;
}
1;