/usr/share/perl5/Graph/Writer/Dot.pm is in libgraph-readwrite-perl 2.09-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 | #
# Graph::Writer::Dot - write a directed graph out in Dot format
#
package Graph::Writer::Dot;
$Graph::Writer::Dot::VERSION = '2.09';
use 5.006;
use strict;
use warnings;
use parent 'Graph::Writer';
#-----------------------------------------------------------------------
# List of valid dot attributes for the entire graph, per node,
# and per edge. You can set other attributes, but they won't get
# written out.
#-----------------------------------------------------------------------
my %valid_attributes =
(
graph => [qw(bb bgcolor center clusterrank color comment compound
concentrate Damping defaultlist dim dpi epsilon fontcolor
fontname fontpath fontsize label labeljust labelloc layers
layersep lp margin maxiter mclimit mindist mode model nodesep
nojustify normalize nslimit nslimit1 ordering ordering
orientation outputorder overlap pack packmode page pagedir
quantum rank rankdir ranksep ratio remincross resolution
root rotate samplepoints searchsize sep showboxes size
splines start stylesheet target truecolor viewport voro_margin)],
node => [qw(bottomlabel color comment distortion fillcolor fixedsize
fontcolor fontname fontsize group height width label layer
margin nojustify orientation peripheries pin pos rects regular
root shape shapefile showboxes sides skew style target
tooltip toplabel URL vertices width z)],
edge => [qw(arrowhead arrowsize arrowtail color comment constraint decorate
dir fontcolor fontname fontsize headURL headclip headhref
headlabel headport headtarget headtooltip href id label
labelangle labeldistance labelfloat labelfontcolor labelfontname
labelfontsize layer len lhead lp ltail minlen nojustify
pos samehead sametail showboxes style tailURL tailclip
tailhref taillabel tailport tailtarget tailtooltip target
tooltip weight)],
);
#=======================================================================
#
# _init()
#
# class-specific initialisation. There isn't any here, but it's
# kept as a place-holder.
#
#=======================================================================
sub _init
{
my $self = shift;
my %param = @_;
$self->SUPER::_init();
$self->{_cluster} = $param{cluster};
}
#=======================================================================
#
# _write_graph()
#
# The private method which actually does the writing out in
# dot format.
#
# This is called from the public method, write_graph(), which is
# found in Graph::Writer.
#
#=======================================================================
sub _write_graph
{
my $self = shift;
my $graph = shift;
my $FILE = shift;
my $v;
my $from;
my $to;
my $gn;
my $attrref;
my @keys;
#-------------------------------------------------------------------
# If the graph has a 'name' attribute, then we use that for the
# name of the digraph instance. Else it's just 'g'.
#-------------------------------------------------------------------
$gn = $graph->has_graph_attribute('name') ? $graph->get_graph_attribute('name') : 'g';
print $FILE "digraph $gn\n{\n";
#-------------------------------------------------------------------
# Dump out any overall attributes of the graph
#-------------------------------------------------------------------
$attrref = $graph->get_graph_attributes();
@keys = grep(exists $attrref->{$_}, @{$valid_attributes{'graph'}});
if (@keys > 0)
{
print $FILE " /* graph attributes */\n";
foreach my $a (@keys)
{
print $FILE " $a = \"", $attrref->{$a}, "\";\n";
}
}
#-------------------------------------------------------------------
# Generate a list of nodes, with attributes for those that have any.
#-------------------------------------------------------------------
print $FILE "\n /* list of nodes */\n";
foreach $v (sort $graph->vertices)
{
print $FILE " \"$v\"";
$attrref = $graph->get_vertex_attributes($v);
@keys = grep(exists $attrref->{$_}, @{$valid_attributes{'node'}});
if (@keys > 0)
{
print $FILE " [", join(',',
map { "$_=\"".$attrref->{$_}."\"" } @keys), "]";
}
print $FILE ";\n";
}
if ($self->{_cluster} && grep { $_ eq $self->{_cluster} } @{$valid_attributes{'node'}}) {
#-------------------------------------------------------------------
# Generate a list of subgraphs based on the attribute value.
#-------------------------------------------------------------------
print $FILE "\n /* list of subgraphs */\n";
my %cluster = ();
foreach my $v (sort $graph->vertices) {
my $attrs = $graph->get_vertex_attributes($v);
next unless $attrs && $attrs->{$self->{_cluster}};
my $attr_value = $attrs->{$self->{_cluster}};
$cluster{$attr_value} = [] unless exists $cluster{$attr_value};
push @{ $cluster{$attr_value} }, $v;
}
foreach my $attr_value (sort keys %cluster) {
print $FILE " subgraph \"cluster_$attr_value\" {\n";
print $FILE " label = \"$attr_value\";\n";
foreach my $node (@{ $cluster{$attr_value} }) {
print $FILE " node [label=\"$node\"] \"$node\";\n";
}
print $FILE " }\n";
}
}
#-------------------------------------------------------------------
# Generate a list of edges, along with any attributes
#-------------------------------------------------------------------
print $FILE "\n /* list of edges */\n";
foreach my $edge (sort _by_vertex $graph->edges)
{
($from, $to) = @$edge;
print $FILE " \"$from\" -> \"$to\"";
$attrref = $graph->get_edge_attributes($from, $to);
@keys = grep(exists $attrref->{$_}, @{$valid_attributes{'edge'}});
if (@keys > 0)
{
print $FILE " [", join(',',
map { "$_ = \"".$attrref->{$_}."\"" } @keys), "]";
}
print $FILE ";\n";
}
#-------------------------------------------------------------------
# close off the digraph instance
#-------------------------------------------------------------------
print $FILE "}\n";
return 1;
}
sub _by_vertex
{
return $a->[0].$a->[1] cmp $b->[0].$b->[1];
}
1;
__END__
=head1 NAME
Graph::Writer::Dot - write out directed graph in Dot format
=head1 SYNOPSIS
use Graph;
use Graph::Writer::Dot;
$graph = Graph->new();
# add edges and nodes to the graph
$writer = Graph::Writer::Dot->new();
$writer->write_graph($graph, 'mygraph.dot');
=head1 DESCRIPTION
B<Graph::Writer::Dot> is a class for writing out a directed graph
in the file format used by the I<dot> tool (part of the AT+T graphviz
package).
The graph must be an instance of the Graph class, which is
actually a set of classes developed by Jarkko Hietaniemi.
=head1 METHODS
=head2 new()
Constructor - generate a new writer instance.
$writer = Graph::Writer::Dot->new();
This can take one optional argument that tell to cluster nodes in subgraphs
by using the attribute passed as value. See:
$writer = Graph::Writer::Dot->new(cluster => 'group');
It will group nodes that have the the same value in the 'group' attribute.
=head2 write_graph()
Write a specific graph to a named file:
$writer->write_graph($graph, $file);
The C<$file> argument can either be a filename,
or a filehandle for a previously opened file.
=head1 SEE ALSO
=over 4
=item L<www.graphviz.org|http://www.graphviz.org/>
The home page for the AT+T graphviz toolkit that
includes the dot tool.
=item L<Graph>
Jarkko Hietaniemi's modules for representing directed graphs,
available from CPAN under modules/by-module/Graph/
=item Algorithms in Perl
The O'Reilly book which has a chapter on directed graphs,
which is based around Jarkko's modules.
=item L<Graph::Writer>
The base-class for Graph::Writer::Dot
=back
=head1 REPOSITORY
L<https://github.com/neilb/Graph-ReadWrite>
=head1 AUTHOR
Neil Bowers E<lt>neil@bowers.comE<gt>
=head1 COPYRIGHT
Copyright (c) 2001-2012, Neil Bowers. All rights reserved.
Copyright (c) 2001, Canon Research Centre Europe. All rights reserved.
This script is free software; you can redistribute it and/or modify
it under the same terms as Perl itself.
=cut
|