1Graph::Easy(3) User Contributed Perl Documentation Graph::Easy(3)
2
6 Graph::Easy - Convert or render graphs (as ASCII, HTML, SVG or via
7 Graphviz)
8
10 use Graph::Easy;
11 my $graph = Graph::Easy->new();
13 # make a fresh copy of the graph
15 my $new_graph = $graph->copy();
16 $graph->add_edge ('Bonn', 'Berlin');
18 # will not add it, since it already exists
20 $graph->add_edge_once ('Bonn', 'Berlin');
21 print $graph->as_ascii( ); # prints:
23 # +------+ +--------+
25 # | Bonn | --> | Berlin |
26 # +------+ +--------+
27 #####################################################
29 # alternatively, let Graph::Easy parse some text:
30 my $graph = Graph::Easy->new( '[Bonn] -> [Berlin]' );
32 #####################################################
34 # slightly more verbose way:
35 my $graph = Graph::Easy->new();
37 my $bonn = $graph->add_node('Bonn');
39 $bonn->set_attribute('border', 'solid 1px black');
40 my $berlin = $graph->add_node('Berlin');
42 $graph->add_edge ($bonn, $berlin);
44 print $graph->as_ascii( );
46 # You can use plain scalars as node names and for the edge label:
48 $graph->add_edge ('Berlin', 'Frankfurt', 'via train');
49 # adding edges with attributes:
51 my $edge = Graph::Easy::Edge->new();
53 $edge->set_attributes( {
54 label => 'train',
55 style => 'dotted',
56 color => 'red',
57 } );
58 # now with the optional edge object
60 $graph->add_edge ($bonn, $berlin, $edge);
61 # raw HTML section
63 print $graph->as_html( );
64 # complete HTML page (with CSS)
66 print $graph->as_html_file( );
67 # Other possibilities:
69 # SVG (possible after you installed Graph::Easy::As_svg):
71 print $graph->as_svg( );
72 # Graphviz:
74 my $graphviz = $graph->as_graphviz();
75 open $DOT, '|dot -Tpng -o graph.png' or die ("Cannot open pipe to dot: $!");
76 print $DOT $graphviz;
77 close $DOT;
78 # Please see also the command line utility 'graph-easy'
80
82 "Graph::Easy" lets you generate graphs consisting of various shaped
83 nodes connected by edges (with optional labels).
84 It can read and write graphs in a variety of formats, as well as render
86 them via its own grid-based layouter.
87 Since the layouter works on a grid (manhattan layout), the output is
89 most useful for flow charts, network diagrams, or hierarchy trees.
90 Input
92 Apart from driving the module with Perl code, you can also use
93 "Graph::Easy::Parser" to parse graph descriptions like:
94 [ Bonn ] --> [ Berlin ]
96 [ Frankfurt ] <=> [ Dresden ]
97 [ Bonn ] -- [ Frankfurt ]
98 See the "EXAMPLES" section below for how this might be rendered.
100 Creating graphs
102 First, create a graph object:
103 my $graph = Graph::Easy->new();
105 Then add a node to it:
107 my $node = $graph->add_node('Koblenz');
109 Don't worry, adding the node again will do nothing:
111 $node = $graph->add_node('Koblenz');
113 You can get back a node by its name with "node()":
115 $node = $graph->node('Koblenz');
117 You can either add another node:
119 my $second = $graph->node('Frankfurt');
121 Or add an edge straight-away:
123 my ($first,$second,$edge) = $graph->add_edge('Mainz','Ulm');
125 Adding the edge the second time creates another edge from 'Mainz' to
127 'Ulm':
128 my $other_edge;
130 ($first,$second,$other_edge) = $graph->add_edge('Mainz','Ulm');
131 This can be avoided by using "add_edge_once()":
133 my $edge = $graph->add_edge_once('Mainz','Ulm');
135 if (defined $edge)
136 {
137 # the first time the edge was added, do something with it
138 $edge->set_attribute('color','blue');
139 }
140 You can set attributes on nodes and edges:
142 $node->attribute('fill', 'yellow');
144 $edge->attribute('label', 'train');
145 It is possible to add an edge with a label:
147 $graph->add_edge('Cottbus', 'Berlin', 'my label');
149 You can also add self-loops:
151 $graph->add_edge('Bremen','Bremen');
153 Adding multiple nodes is easy:
155 my ($bonn,$rom) = Graph::Easy->add_nodes('Bonn','Rom');
157 You can also have subgraphs (these are called groups):
159 my ($group) = Graph::Easy->add_group('Cities');
161 Only nodes can be part of a group, edges are automatically considered
163 to be in the group if they lead from one node inside the group to
164 another node in the same group. There are multiple ways to add one or
165 more nodes into a group:
166 $group->add_member($bonn);
168 $group->add_node($rom);
169 $group->add_nodes($rom,$bonn);
170 For more options please see the online manual:
172 <http://bloodgate.com/perl/graph/manual/> .
173 Output
175 The output can be done in various styles:
176 ASCII ART
178 Uses things like "+", "-" "<" and "|" to render the boxes.
179 BOXART
181 Uses Unicode box art drawing elements to output the graph.
182 HTML
184 HTML tables with CSS making everything "pretty".
185 SVG
187 Creates a Scalable Vector Graphics output.
188 Graphviz
190 Creates graphviz code that can be feed to 'dot', 'neato' or similar
191 programs.
192 GraphML
194 Creates a textual description of the graph in the GraphML format.
195 GDL/VCG
197 Creates a textual description of the graph in the VCG or GDL (Graph
198 Description Language) format.
199
201 The following examples are given in the simple text format that is
202 understood by Graph::Easy::Parser.
203 You can also see many more examples at:
205 <http://bloodgate.com/perl/graph/>
207 One node
209 The most simple graph (apart from the empty one :) is a graph
210 consisting of only one node:
211 [ Dresden ]
213 Two nodes
215 A simple graph consisting of two nodes, linked together by a directed
216 edge:
217 [ Bonn ] -> [ Berlin ]
219 Three nodes
221 A graph consisting of three nodes, and both are linked from the first:
222 [ Bonn ] -> [ Berlin ]
224 [ Bonn ] -> [ Hamburg ]
225 Three nodes in a chain
227 A graph consisting of three nodes, showing that you can chain
228 connections together:
229 [ Bonn ] -> [ Berlin ] -> [ Hamburg ]
231 Two not connected graphs
233 A graph consisting of two separate parts, both of them not connected to
234 each other:
235 [ Bonn ] -> [ Berlin ]
237 [ Freiburg ] -> [ Hamburg ]
238 Three nodes, interlinked
240 A graph consisting of three nodes, and two of the are connected from
241 the first node:
242 [ Bonn ] -> [ Berlin ]
244 [ Berlin ] -> [ Hamburg ]
245 [ Bonn ] -> [ Hamburg ]
246 Different edge styles
248 A graph consisting of a couple of nodes, linked with the different
249 possible edge styles.
250 [ Bonn ] <-> [ Berlin ] # bidirectional
252 [ Berlin ] ==> [ Rostock ] # double
253 [ Hamburg ] ..> [ Altona ] # dotted
254 [ Dresden ] - > [ Bautzen ] # dashed
255 [ Leipzig ] ~~> [ Kirchhain ] # wave
256 [ Hof ] .-> [ Chemnitz ] # dot-dash
257 [ Magdeburg ] <=> [ Ulm ] # bidrectional, double etc
258 [ Magdeburg ] -- [ Ulm ] # arrow-less edge
259 More examples at: <http://bloodgate.com/perl/graph/>
261
263 Note: Animations are not yet implemented!
264 It is possible to add animations to a graph. This is done by adding
266 steps via the pseudo-class "step":
267 step.0 {
269 target: Bonn; # find object with id=Bonn, or
270 # if this fails, the node named
271 # "Bonn".
272 animate: fill: # animate this attribute
273 from: yellow; # start value (0% of duration)
274 via: red; # at 50% of the duration
275 to: yellow; # and 100% of duration
276 wait: 0; # after triggering, wait so many seconds
277 duration: 5; # entire time to go from "from" to "to"
278 trigger: onload; # when to trigger this animation
279 repeat: 2; # how often to repeat ("2" means two times)
280 # also "infinite", then "next" will be ignored
281 next: 1; # which step to take after repeat is up
282 }
283 step.1 {
284 from: white; # set to white
285 to: white;
286 duration: 0.1; # 100ms
287 next: 0; # go back to step.0
288 }
289 Here two steps are created, 0 and 1 and the animation will be going
291 like this:
292 0.1s
294 +-------------------------------+
295 v |
296 +--------+ 0s +--------+ 5s +--------+ 5s +--------+
297 | onload | ----> | step.0 | ----> | step.0 | ----> | step.1 |
298 +--------+ +--------+ +--------+ +--------+
299 You can generate a a graph with the animation flow via
301 "animation_as_graph()".
302 Output
304 Currently no output formats supports animations yet.
305
307 "Graph::Easy" supports the following methods:
308 new()
310 use Graph::Easy;
311 my $graph = Graph::Easy->new( );
313 Creates a new, empty "Graph::Easy" object.
315 Takes optional a hash reference with a list of options. The following
317 are valid options:
318 debug if true, enables debug output
320 timeout timeout (in seconds) for the layouter
321 fatal_errors wrong attributes are fatal errors, default: true
322 strict test attribute names for being valid, default: true
323 undirected create an undirected graph, default: false
324 copy()
326 my $copy = $graph->copy( );
327 Create a copy of this graph and return it as a new Graph::Easy object.
329 error()
331 my $error = $graph->error();
332 Returns the last error or '' for none. Optionally, takes an error
334 message to be set.
335 $graph->error( 'Expected Foo, but found Bar.' );
337 See warn() on how to catch error messages. See also non_fatal_errors()
339 on how to turn errors into warnings.
340 warn()
342 my $warning = $graph->warn();
343 Returns the last warning or '' for none. Optionally, takes a warning
345 message to be output to STDERR:
346 $graph->warn( 'Expected Foo, but found Bar.' );
348 If you want to catch warnings from the layouter, enable catching of
350 warnings or errors:
351 $graph->catch_messages(1);
353 # Or individually:
355 # $graph->catch_warnings(1);
356 # $graph->catch_errors(1);
357 # something which warns or throws an error:
359 ...
360 if ($graph->error())
362 {
363 my @errors = $graph->errors();
364 }
365 if ($graph->warning())
366 {
367 my @warnings = $graph->warnings();
368 }
369 See Graph::Easy::Base for more details on error/warning message
371 capture.
372 add_edge()
374 my ($first, $second, $edge) = $graph->add_edge( 'node 1', 'node 2');
375 add_edge()
377 my ($first, $second, $edge) = $graph->add_edge( 'node 1', 'node 2');
378 my $edge = $graph->add_edge( $x, $y, $edge);
379 $graph->add_edge( $x, $y);
380 Add an edge between nodes X and Y. The optional edge object defines the
382 style of the edge, if not present, a default object will be used.
383 When called in scalar context, will return $edge. In array/list context
385 it will return the two nodes and the edge object.
386 $x and $y should be either plain scalars with the names of the nodes,
388 or objects of Graph::Easy::Node, while the optional $edge should be
389 Graph::Easy::Edge.
390 Note: "Graph::Easy" graphs are multi-edged, and adding the same edge
392 twice will result in two edges going from $x to $y! See
393 "add_edge_once()" on how to avoid that.
394 You can also use "edge()" to check whether an edge from X to Y already
396 exists in the graph.
397 add_edge_once()
399 my ($first, $second, $edge) = $graph->add_edge_once( 'node 1', 'node 2');
400 my $edge = $graph->add_edge_once( $x, $y, $edge);
401 $graph->add_edge_once( $x, $y);
402 if (defined $edge)
404 {
405 # got added once, so do something with it
406 $edge->set_attribute('label','unique');
407 }
408 Adds an edge between nodes X and Y, unless there exists already an edge
410 between these two nodes. See "add_edge()".
411 Returns undef when an edge between X and Y already exists.
413 When called in scalar context, will return $edge. In array/list context
415 it will return the two nodes and the edge object.
416 flip_edges()
418 my $graph = Graph::Easy->new();
419 $graph->add_edge('Bonn','Berlin');
420 $graph->add_edge('Berlin','Bonn');
421 print $graph->as_ascii();
423 # +--------------+
425 # v |
426 # +--------+ +------+
427 # | Berlin | --> | Bonn |
428 # +--------+ +------+
429 $graph->flip_edges('Bonn', 'Berlin');
431 print $graph->as_ascii();
433 # +--------------+
435 # | v
436 # +--------+ +------+
437 # | Berlin | --> | Bonn |
438 # +--------+ +------+
439 Turn around (transpose) all edges that are going from the first node to
441 the second node.
442 add_node()
444 my $node = $graph->add_node( 'Node 1' );
445 # or if you already have a Graph::Easy::Node object:
446 $graph->add_node( $x );
447 Add a single node X to the graph. $x should be either a
449 "Graph::Easy::Node" object, or a unique name for the node. Will do
450 nothing if the node already exists in the graph.
451 It returns an Graph::Easy::Node object.
453 add_anon_node()
455 my $anon_node = $graph->add_anon_node( );
456 Creates a single, anonymous node and adds it to the graph, returning
458 the "Graph::Easy::Node::Anon" object.
459 The created node is equal to one created via " [ ] " in the Graph::Easy
461 text description.
462 add_nodes()
464 my @nodes = $graph->add_nodes( 'Node 1', 'Node 2' );
465 Add all the given nodes to the graph. The arguments should be either a
467 "Graph::Easy::Node" object, or a unique name for the node. Will do
468 nothing if the node already exists in the graph.
469 It returns a list of Graph::Easy::Node objects.
471 rename_node()
473 $node = $graph->rename_node($node, $new_name);
474 Changes the name of a node. If the passed node is not part of this
476 graph or just a string, it will be added with the new name to this
477 graph.
478 If the node was part of another graph, it will be deleted there and
480 added to this graph with the new name, effectively moving the node from
481 the old to the new graph and renaming it at the same time.
482 del_node()
484 $graph->del_node('Node name');
485 $graph->del_node($node);
486 Delete the node with the given name from the graph.
488 del_edge()
490 $graph->del_edge($edge);
491 Delete the given edge object from the graph. You can use "edge()" to
493 find an edge from Node A to B:
494 $graph->del_edge( $graph->edge('A','B') );
496 merge_nodes()
498 $graph->merge_nodes( $first_node, $second_node );
499 $graph->merge_nodes( $first_node, $second_node, $joiner );
500 Merge two nodes. Will delete all connections between the two nodes,
502 then move over any connection to/from the second node to the first,
503 then delete the second node from the graph.
504 Any attributes on the second node will be lost.
506 If present, the optional $joiner argument will be used to join the
508 label of the second node to the label of the first node. If not
509 present, the label of the second node will be dropped along with all
510 the other attributes:
511 my $graph = Graph::Easy->new('[A]->[B]->[C]->[D]');
513 # this produces "[A]->[C]->[D]"
515 $graph->merge_nodes( 'A', 'B' );
516 # this produces "[A C]->[D]"
518 $graph->merge_nodes( 'A', 'C', ' ' );
519 # this produces "[A C \n D]", note single quotes on the third argument!
521 $graph->merge_nodes( 'A', 'C', ' \n ' );
522 get_attribute()
524 my $value = $graph->get_attribute( $class, $name );
525 Return the value of attribute $name from class $class.
527 Example:
529 my $color = $graph->attribute( 'node', 'color' );
531 You can also call all the various attribute related methods on members
533 of the graph directly, for instance:
534 $node->get_attribute('label');
536 $edge->get_attribute('color');
537 $group->get_attribute('fill');
538 attribute()
540 my $value = $graph->attribute( $class, $name );
541 Is an alias for get_attribute.
543 color_attribute()
545 # returns f.i. #ff0000
546 my $color = $graph->get_color_attribute( 'node', 'color' );
547 Just like get_attribute(), but only for colors, and returns them as
549 hex, using the current colorscheme.
550 get_color_attribute()
552 Is an alias for color_attribute().
553 get_attributes()
555 my $att = $object->get_attributes();
556 Return all effective attributes on this object (graph/node/group/edge)
558 as an anonymous hash ref. This respects inheritance and default values.
559 Note that this does not include custom attributes.
561 See also get_custom_attributes and raw_attributes().
563 get_custom_attributes()
565 my $att = $object->get_custom_attributes();
566 Return all the custom attributes on this object (graph/node/group/edge)
568 as an anonymous hash ref.
569 custom_attributes()
571 my $att = $object->custom_attributes();
572 "custom_attributes()" is an alias for get_custom_attributes.
574 raw_attributes()
576 my $att = $object->raw_attributes();
577 Return all set attributes on this object (graph, node, group or edge)
579 as an anonymous hash ref. Thus you get all the locally active
580 attributes for this object.
581 Inheritance is respected, e.g. attributes that have the value "inherit"
583 and are inheritable, will be inherited from the base class.
584 But default values for unset attributes are skipped. Here is an
586 example:
587 node { color: red; }
589 [ A ] { class: foo; color: inherit; }
591 This will return:
593 { class => foo, color => red }
595 As you can see, attributes like "background" etc. are not included,
597 while the color value was inherited properly.
598 See also get_attributes().
600 default_attribute()
602 my $def = $graph->default_attribute($class, 'fill');
603 Returns the default value for the given attribute in the class of the
605 object.
606 The default attribute is the value that will be used if the attribute
608 on the object itself, as well as the attribute on the class is unset.
609 To find out what attribute is on the class, use the three-arg form of
611 attribute on the graph:
612 my $g = Graph::Easy->new();
614 my $node = $g->add_node('Berlin');
615 print $node->attribute('fill'), "\n"; # print "white"
617 print $node->default_attribute('fill'), "\n"; # print "white"
618 print $g->attribute('node','fill'), "\n"; # print "white"
619 $g->set_attribute('node','fill','red'); # class is "red"
621 $node->set_attribute('fill','green'); # this object is "green"
622 print $node->attribute('fill'), "\n"; # print "green"
624 print $node->default_attribute('fill'), "\n"; # print "white"
625 print $g->attribute('node','fill'), "\n"; # print "red"
626 See also raw_attribute().
628 raw_attribute()
630 my $value = $object->raw_attribute( $name );
631 Return the value of attribute $name from the object it this method is
633 called on (graph, node, edge, group etc.). If the attribute is not set
634 on the object itself, returns undef.
635 This method respects inheritance, so an attribute value of 'inherit' on
637 an object will make the method return the inherited value:
638 my $g = Graph::Easy->new();
640 my $n = $g->add_node('A');
641 $g->set_attribute('color','red');
643 print $n->raw_attribute('color'); # undef
645 $n->set_attribute('color','inherit');
646 print $n->raw_attribute('color'); # 'red'
647 See also attribute().
649 raw_color_attribute()
651 # returns f.i. #ff0000
652 my $color = $graph->raw_color_attribute('color' );
653 Just like raw_attribute(), but only for colors, and returns them as
655 hex, using the current colorscheme.
656 If the attribute is not set on the object, returns "undef".
658 raw_attributes()
660 my $att = $object->raw_attributes();
661 Returns a hash with all the raw attributes of that object. Attributes
663 that are no set on the object itself, but on the class this object
664 belongs to are not included.
665 This method respects inheritance, so an attribute value of 'inherit' on
667 an object will make the method return the inherited value.
668 set_attribute()
670 # Set the attribute on the given class.
671 $graph->set_attribute( $class, $name, $val );
672 # Set the attribute on the graph itself. This is synonymous
674 # to using 'graph' as class in the form above.
675 $graph->set_attribute( $name, $val );
676 Sets a given attribute named $name to the new value $val in the class
678 specified in $class.
679 Example:
681 $graph->set_attribute( 'graph', 'gid', '123' );
683 The class can be one of "graph", "edge", "node" or "group". The last
685 three can also have subclasses like in "node.subclassname".
686 You can also call the various attribute related methods on members of
688 the graph directly, for instance:
689 $node->set_attribute('label', 'my node');
691 $edge->set_attribute('color', 'red');
692 $group->set_attribute('fill', 'green');
693 set_attributes()
695 $graph->set_attributes( $class, $att );
696 Given a class name in $class and a hash of mappings between attribute
698 names and values in $att, will set all these attributes.
699 The class can be one of "graph", "edge", "node" or "group". The last
701 three can also have subclasses like in "node.subclassname".
702 Example:
704 $graph->set_attributes( 'node', { color => 'red', background => 'none' } );
706 del_attribute()
708 $graph->del_attribute('border');
709 Delete the attribute with the given name from the object.
711 You can also call the various attribute related methods on members of
713 the graph directly, for instance:
714 $node->del_attribute('label');
716 $edge->del_attribute('color');
717 $group->del_attribute('fill');
718 unquote_attribute()
720 # returns '"Hello World!"'
721 my $value = $self->unquote_attribute('node','label','"Hello World!"');
722 # returns 'red'
723 my $color = $self->unquote_attribute('node','color','"red"');
724 Return the attribute unquoted except for labels and titles, that is it
726 removes double quotes at the start and the end of the string, unless
727 these are escaped with a backslash.
728 border_attribute()
730 my $border = $graph->border_attribute();
731 Return the combined border attribute like "1px solid red" from the
733 border(style|color|width) attributes.
734 split_border_attributes()
736 my ($style,$width,$color) = $graph->split_border_attribute($border);
737 Split the border attribute (like "1px solid red") into the three
739 different parts.
740 quoted_comment()
742 my $cmt = $node->comment();
743 Comment of this object, quoted suitable as to be embedded into
745 HTML/SVG. Returns the empty string if this object doesn't have a
746 comment set.
747 flow()
749 my $flow = $graph->flow();
750 Returns the flow of the graph, as absolute number in degress.
752 source_nodes()
754 my @roots = $graph->source_nodes();
755 Returns all nodes that have only outgoing edges, e.g. are the root of a
757 tree, in no particular order.
758 Isolated nodes (no edges at all) will not be included, see
760 predecessorless_nodes() to get these, too.
761 In scalar context, returns the number of source nodes.
763 predecessorless_nodes()
765 my @roots = $graph->predecessorless_nodes();
766 Returns all nodes that have no incoming edges, regardless of whether
768 they have outgoing edges or not, in no particular order.
769 Isolated nodes (no edges at all) will be included in the list.
771 See also source_nodes().
773 In scalar context, returns the number of predecessorless nodes.
775 root_node()
777 my $root = $graph->root_node();
778 Return the root node as Graph::Easy::Node object, if it was set with
780 the 'root' attribute.
781 timeout()
783 print $graph->timeout(), " seconds timeout for layouts.\n";
784 $graph->timeout(12);
785 Get/set the timeout for layouts in seconds. If the layout process did
787 not finish after that time, it will be stopped and a warning will be
788 printed.
789 The default timeout is 5 seconds.
791 strict()
793 print "Graph has strict checking\n" if $graph->strict();
794 $graph->strict(undef); # disable strict attribute checks
795 Get/set the strict option. When set to a true value, all attribute
797 names and values will be strictly checked and unknown/invalid one will
798 be rejected.
799 This option is on by default.
801 type()
803 print "Graph is " . $graph->type() . "\n";
804 Returns the type of the graph as string, either "directed" or
806 "undirected".
807 layout()
809 $graph->layout();
810 $graph->layout( type => 'force', timeout => 60 );
811 Creates the internal structures to layout the graph.
813 This method will be called automatically when you call any of the
815 "as_FOO" methods or "output()" as described below.
816 The options are:
818 type the type of the layout, possible values:
820 'force' - force based layouter
821 'adhoc' - the default layouter
822 timeout timeout in seconds
823 See also: timeout().
825 output_format()
827 $graph->output_format('html');
828 Set the outputformat. One of 'html', 'ascii', 'graphviz', 'svg' or
830 'txt'. See also output().
831 output()
833 my $out = $graph->output();
834 Output the graph in the format set by "output_format()".
836 as_ascii()
838 print $graph->as_ascii();
839 Return the graph layout in ASCII art, in utf-8.
841 as_ascii_file()
843 print $graph->as_ascii_file();
844 Is an alias for as_ascii.
846 as_ascii_html()
848 print $graph->as_ascii_html();
849 Return the graph layout in ASCII art, suitable to be embedded into an
851 HTML page. Basically it wraps the output from as_ascii() into "<pre>
852 </pre>" and inserts real HTML links. The returned string is in utf-8.
853 as_boxart()
855 print $graph->as_box();
856 Return the graph layout as box drawing using Unicode characters (in
858 utf-8, as always).
859 as_boxart_file()
861 print $graph->as_boxart_file();
862 Is an alias for "as_box".
864 as_boxart_html()
866 print $graph->as_boxart_html();
867 Return the graph layout as box drawing using Unicode characters, as
869 chunk that can be embedded into an HTML page.
870 Basically it wraps the output from as_boxart() into "<pre> </pre>" and
872 inserts real HTML links. The returned string is in utf-8.
873 as_boxart_html_file()
875 print $graph->as_boxart_html_file();
876 Return the graph layout as box drawing using Unicode characters, as a
878 full HTML page complete with header and footer.
879 as_html()
881 print $graph->as_html();
882 Return the graph layout as HTML section. See css() to get the CSS
884 section to go with that HTML code. If you want a complete HTML page
885 then use as_html_file().
886 as_html_page()
888 print $graph->as_html_page();
889 Is an alias for "as_html_file".
891 as_html_file()
893 print $graph->as_html_file();
894 Return the graph layout as HTML complete with headers, CSS section and
896 footer. Can be viewed in the browser of your choice.
897 add_group()
899 my $group = $graph->add_group('Group name');
900 Add a group to the graph and return it as Graph::Easy::Group object.
902 group()
904 my $group = $graph->group('Name');
905 Returns the group with the name "Name" as Graph::Easy::Group object.
907 rename_group()
909 $group = $graph->rename_group($group, $new_name);
910 Changes the name of the given group. If the passed group is not part of
912 this graph or just a string, it will be added with the new name to this
913 graph.
914 If the group was part of another graph, it will be deleted there and
916 added to this graph with the new name, effectively moving the group
917 from the old to the new graph and renaming it at the same time.
918 groups()
920 my @groups = $graph->groups();
921 Returns the groups of the graph as Graph::Easy::Group objects, in
923 arbitrary order.
924 groups_within()
926 # equivalent to $graph->groups():
927 my @groups = $graph->groups_within(); # all
928 my @toplevel_groups = $graph->groups_within(0); # level 0 only
929 Return the groups that are inside this graph, up to the specified
931 level, in arbitrary order.
932 The default level is -1, indicating no bounds and thus all contained
934 groups are returned.
935 A level of 0 means only the direct children, and hence only the
937 toplevel groups will be returned. A level 1 means the toplevel groups
938 and their toplevel children, and so on.
939 anon_groups()
941 my $anon_groups = $graph->anon_groups();
942 In scalar context, returns the number of anon groups (aka
944 Graph::Easy::Group::Anon) the graph has.
945 In list context, returns all anon groups as objects, in arbitrary
947 order.
948 del_group()
950 $graph->del_group($name);
951 Delete the group with the given name.
953 edges(), edges_within()
955 my @edges = $graph->edges();
956 Returns the edges of the graph as Graph::Easy::Edge objects, in
958 arbitrary order.
959 edges_within() is an alias for "edges()".
961 is_simple_graph(), is_simple()
963 if ($graph->is_simple())
964 {
965 }
966 Returns true if the graph does not have multiedges, e.g. if it does not
968 have more than one edge going from any node to any other node or group.
969 Since this method has to look at all edges, it is costly in terms of
971 both CPU and memory.
972 is_directed()
974 if ($graph->is_directed())
975 {
976 }
977 Returns true if the graph is directed.
979 is_undirected()
981 if ($graph->is_undirected())
982 {
983 }
984 Returns true if the graph is undirected.
986 parent()
988 my $parent = $graph->parent();
989 Returns the parent graph, for graphs this is undef.
991 label()
993 my $label = $graph->label();
994 Returns the label of the graph.
996 title()
998 my $title = $graph->title();
999 Returns the (mouseover) title of the graph.
1001 link()
1003 my $link = $graph->link();
1004 Return a potential link (for the graphs label), build from the
1006 attributes "linkbase" and "link" (or autolink). Returns '' if there is
1007 no link.
1008 as_graphviz()
1010 print $graph->as_graphviz();
1011 Return the graph as graphviz code, suitable to be feed to a program
1013 like "dot" etc.
1014 as_graphviz_file()
1016 print $graph->as_graphviz_file();
1017 Is an alias for as_graphviz().
1019 angle()
1021 my $degrees = Graph::Easy->angle( 'south' );
1022 my $degrees = Graph::Easy->angle( 120 );
1023 Check an angle for being valid and return a value between -359 and 359
1025 degrees. The special values "south", "north", "west", "east", "up" and
1026 "down" are also valid and converted to degrees.
1027 nodes()
1029 my $nodes = $graph->nodes();
1030 In scalar context, returns the number of nodes/vertices the graph has.
1032 In list context, returns all nodes as objects, in arbitrary order.
1034 anon_nodes()
1036 my $anon_nodes = $graph->anon_nodes();
1037 In scalar context, returns the number of anon nodes (aka
1039 Graph::Easy::Node::Anon) the graph has.
1040 In list context, returns all anon nodes as objects, in arbitrary order.
1042 html_page_header()
1044 my $header = $graph->html_page_header();
1045 my $header = $graph->html_page_header($css);
1046 Return the header of an HTML page. Used together with html_page_footer
1048 by as_html_page to construct a complete HTML page.
1049 Takes an optional parameter with the CSS styles to be inserted into the
1051 header. If $css is not defined, embedds the result of "$self->css()".
1052 html_page_footer()
1054 my $footer = $graph->html_page_footer();
1055 Return the footer of an HTML page. Used together with html_page_header
1057 by as_html_page to construct a complete HTML page.
1058 css()
1060 my $css = $graph->css();
1061 Return CSS code for that graph. See as_html().
1063 as_txt()
1065 print $graph->as_txt();
1066 Return the graph as a normalized textual representation, that can be
1068 parsed with Graph::Easy::Parser back to the same graph.
1069 This does not call layout() since the actual text representation is
1071 just a dump of the graph.
1072 as_txt_file()
1074 print $graph->as_txt_file();
1075 Is an alias for as_txt().
1077 as_svg()
1079 print $graph->as_svg();
1080 Return the graph as SVG (Scalable Vector Graphics), which can be
1082 embedded into HTML pages. You need to install Graph::Easy::As_svg first
1083 to make this work.
1084 See also as_svg_file().
1086 Note: You need Graph::Easy::As_svg installed for this to work!
1088 as_svg_file()
1090 print $graph->as_svg_file();
1091 Returns SVG just like "as_svg()", but this time as standalone SVG,
1093 suitable for storing it in a file and referencing it externally.
1094 After calling "as_svg_file()" or "as_svg()", you can retrieve some SVG
1096 information, notable "width" and "height" via "svg_information".
1097 Note: You need Graph::Easy::As_svg installed for this to work!
1099 svg_information()
1101 my $info = $graph->svg_information();
1102 print "Size: $info->{width}, $info->{height}\n";
1104 Return information about the graph created by the last "as_svg()" or
1106 "as_svg_file()" call.
1107 The following fields are set:
1109 width width of the SVG in pixels
1111 height height of the SVG in pixels
1112 Note: You need Graph::Easy::As_svg installed for this to work!
1114 as_vcg()
1116 print $graph->as_vcg();
1117 Return the graph as VCG text. VCG is a subset of GDL (Graph Description
1119 Language).
1120 This does not call layout() since the actual text representation is
1122 just a dump of the graph.
1123 as_vcg_file()
1125 print $graph->as_vcg_file();
1126 Is an alias for as_vcg().
1128 as_gdl()
1130 print $graph->as_gdl();
1131 Return the graph as GDL (Graph Description Language) text. GDL is a
1133 superset of VCG.
1134 This does not call layout() since the actual text representation is
1136 just a dump of the graph.
1137 as_gdl_file()
1139 print $graph->as_gdl_file();
1140 Is an alias for as_gdl().
1142 as_graphml()
1144 print $graph->as_graphml();
1145 Return the graph as a GraphML representation.
1147 This does not call layout() since the actual text representation is
1149 just a dump of the graph.
1150 The output contains only the set attributes, e.g. default attribute
1152 values are not specifically mentioned. The attribute names and values
1153 are the in the format that "Graph::Easy" defines.
1154 as_graphml_file()
1156 print $graph->as_graphml_file();
1157 Is an alias for as_graphml().
1159 sorted_nodes()
1161 my $nodes =
1162 $graph->sorted_nodes( ); # default sort on 'id'
1163 my $nodes =
1164 $graph->sorted_nodes( 'name' ); # sort on 'name'
1165 my $nodes =
1166 $graph->sorted_nodes( 'layer', 'id' ); # sort on 'layer', then on 'id'
1167 In scalar context, returns the number of nodes/vertices the graph has.
1169 In list context returns a list of all the node objects (as reference),
1170 sorted by their attribute(s) given as arguments. The default is 'id',
1171 e.g. their internal ID number, which amounts more or less to the order
1172 they have been inserted.
1173 This routine will sort the nodes by their group first, so the requested
1175 sort order will be only valid if there are no groups or inside each
1176 group.
1177 as_debug()
1179 print $graph->as_debug();
1180 Return debugging information like version numbers of used modules, and
1182 a textual representation of the graph.
1183 This does not call layout() since the actual text representation is
1185 more a dump of the graph, than a certain layout.
1186 node()
1188 my $node = $graph->node('node name');
1189 Return node by unique name (case sensitive). Returns undef if the node
1191 does not exist in the graph.
1192 edge()
1194 my $edge = $graph->edge( $x, $y );
1195 Returns the edge objects between nodes $x and $y. Both $x and $y can be
1197 either scalars with names or "Graph::Easy::Node" objects.
1198 Returns undef if the edge does not yet exist.
1200 In list context it will return all edges from $x to $y, in scalar
1202 context it will return only one (arbitrary) edge.
1203 id()
1205 my $graph_id = $graph->id();
1206 $graph->id('123');
1207 Returns the id of the graph. You can also set a new ID with this
1209 routine. The default is ''.
1210 The graph's ID is used to generate unique CSS classes for each graph,
1212 in the case you want to have more than one graph in an HTML page.
1213 seed()
1215 my $seed = $graph->seed();
1216 $graph->seed(2);
1217 Get/set the random seed for the graph object. See randomize() for a
1219 method to set a random seed.
1220 The seed is used to create random numbers for the layouter. For the
1222 same graph, the same seed will always lead to the same layout.
1223 randomize()
1225 $graph->randomize();
1226 Set a random seed for the graph object. See seed().
1228 debug()
1230 my $debug = $graph->debug(); # get
1231 $graph->debug(1); # enable
1232 $graph->debug(0); # disable
1233 Enable, disable or read out the debug status. When the debug status is
1235 true, additional debug messages will be printed on STDERR.
1236 score()
1238 my $score = $graph->score();
1239 Returns the score of the graph, or undef if layout() has not yet been
1241 called.
1242 Higher scores are better, although you cannot compare scores for
1244 different graphs. The score should only be used to compare different
1245 layouts of the same graph against each other:
1246 my $max = undef;
1248 $graph->randomize();
1250 my $seed = $graph->seed();
1251 $graph->layout();
1253 $max = $graph->score();
1254 for (1..10)
1256 {
1257 $graph->randomize(); # select random seed
1258 $graph->layout(); # layout with that seed
1259 if ($graph->score() > $max)
1260 {
1261 $max = $graph->score(); # store the new max store
1262 $seed = $graph->seed(); # and it's seed
1263 }
1264 }
1265 # redo the best layout
1267 if ($seed ne $graph->seed())
1268 {
1269 $graph->seed($seed);
1270 $graph->layout();
1271 }
1272 # output graph:
1273 print $graph->as_ascii(); # or as_html() etc
1274 valid_attribute()
1276 my $graph = Graph::Easy->new();
1277 my $new_value =
1278 $graph->valid_attribute( $name, $value, $class );
1279 if (ref($new_value) eq 'ARRAY' && @$new_value == 0)
1281 {
1282 # throw error
1283 die ("'$name' is not a valid attribute name for '$class'")
1284 if $self->{_warn_on_unused_attributes};
1285 }
1286 elsif (!defined $new_value)
1287 {
1288 # throw error
1289 die ("'$value' is no valid '$name' for '$class'");
1290 }
1291 Deprecated, please use validate_attribute().
1293 Check that a "$name,$value" pair is a valid attribute in class $class,
1295 and returns a new value.
1296 It returns an array ref if the attribute name is invalid, and undef if
1298 the value is invalid.
1299 The return value can differ from the passed in value, f.i.:
1301 print $graph->valid_attribute( 'color', 'red' );
1303 This would print '#ff0000';
1305 validate_attribute()
1307 my $graph = Graph::Easy->new();
1308 my ($rc,$new_name, $new_value) =
1309 $graph->validate_attribute( $name, $value, $class );
1310 Checks a given attribute name and value (or values, in case of a value
1312 like "red|green") for being valid. It returns a new attribute name (in
1313 case of "font-color" => "fontcolor") and either a single new attribute,
1314 or a list of attribute values as array ref.
1315 If $rc is defined, it is the error number:
1317 1 unknown attribute name
1319 2 invalid attribute value
1320 4 found multiple attributes, but these arent
1321 allowed at this place
1322 color_as_hex()
1324 my $hexred = Graph::Easy->color_as_hex( 'red' );
1325 my $hexblue = Graph::Easy->color_as_hex( '#0000ff' );
1326 my $hexcyan = Graph::Easy->color_as_hex( '#f0f' );
1327 my $hexgreen = Graph::Easy->color_as_hex( 'rgb(0,255,0)' );
1328 Takes a valid color name or definition (hex, short hex, or RGB) and
1330 returns the color in hex like "#ff00ff".
1331 color_value($color_name, $color_scheme)
1333 my $color = Graph::Easy->color_name( 'red' ); # #ff0000
1334 print Graph::Easy->color_name( '#ff0000' ); # #ff0000
1335 print Graph::Easy->color_name( 'snow', 'x11' );
1337 Given a color name, returns the color in hex. See color_name for a list
1339 of possible values for the optional $color_scheme parameter.
1340 color_name($color_value, $color_scheme)
1342 my $color = Graph::Easy->color_name( 'red' ); # red
1343 print Graph::Easy->color_name( '#ff0000' ); # red
1344 print Graph::Easy->color_name( 'snow', 'x11' );
1346 Takes a hex color value and returns the name of the color.
1348 The optional parameter is the color scheme, where the following values
1350 are possible:
1351 w3c (the default)
1353 x11 (what graphviz uses as default)
1354 Plus the following ColorBrewer schemes are supported, see the online
1356 manual for examples and their usage:
1357 accent3 accent4 accent5 accent6 accent7 accent8
1359 blues3 blues4 blues5 blues6 blues7 blues8 blues9
1361 brbg3 brbg4 brbg5 brbg6 brbg7 brbg8 brbg9 brbg10 brbg11
1363 bugn3 bugn4 bugn5 bugn6 bugn7 bugn8 bugn9 bupu3 bupu4 bupu5 bupu6 bupu7
1365 bupu8 bupu9
1366 dark23 dark24 dark25 dark26 dark27 dark28
1368 gnbu3 gnbu4 gnbu5 gnbu6 gnbu7 gnbu8 gnbu9
1370 greens3 greens4 greens5 greens6 greens7 greens8 greens9
1372 greys3 greys4 greys5 greys6 greys7 greys8 greys9
1374 oranges3 oranges4 oranges5 oranges6 oranges7 oranges8 oranges9
1376 orrd3 orrd4 orrd5 orrd6 orrd7 orrd8 orrd9
1378 paired3 paired4 paired5 paired6 paired7 paired8 paired9 paired10 paired11
1380 paired12
1381 pastel13 pastel14 pastel15 pastel16 pastel17 pastel18 pastel19
1383 pastel23 pastel24 pastel25 pastel26 pastel27 pastel28
1385 piyg3 piyg4 piyg5 piyg6 piyg7 piyg8 piyg9 piyg10 piyg11
1387 prgn3 prgn4 prgn5 prgn6 prgn7 prgn8 prgn9 prgn10 prgn11
1389 pubu3 pubu4 pubu5 pubu6 pubu7 pubu8 pubu9
1391 pubugn3 pubugn4 pubugn5 pubugn6 pubugn7 pubugn8 pubugn9
1393 puor3 puor4 puor5 puor6 puor7 puor8 puor9 puor10 puor11
1395 purd3 purd4 purd5 purd6 purd7 purd8 purd9
1397 purples3 purples4 purples5 purples6 purples7 purples8 purples9
1399 rdbu3 rdbu4 rdbu5 rdbu6 rdbu7 rdbu8 rdbu9 rdbu10 rdbu11
1401 rdgy3 rdgy4 rdgy5 rdgy6 rdgy7 rdgy8 rdgy9
1403 rdpu3 rdpu4 rdpu5 rdpu6 rdpu7 rdpu8 rdpu9 rdgy10 rdgy11
1405 rdylbu3 rdylbu4 rdylbu5 rdylbu6 rdylbu7 rdylbu8 rdylbu9 rdylbu10 rdylbu11
1407 rdylgn3 rdylgn4 rdylgn5 rdylgn6 rdylgn7 rdylgn8 rdylgn9 rdylgn10 rdylgn11
1409 reds3 reds4 reds5 reds6 reds7 reds8 reds9
1411 set13 set14 set15 set16 set17 set18 set19
1413 set23 set24 set25 set26 set27 set28
1415 set33 set34 set35 set36 set37 set38 set39 set310 set311 set312
1417 spectral3 spectral4 spectral5 spectral6 spectral7 spectral8 spectral9
1419 spectral10 spectral11
1420 ylgn3 ylgn4 ylgn5 ylgn6 ylgn7 ylgn8 ylgn9
1422 ylgnbu3 ylgnbu4 ylgnbu5 ylgnbu6 ylgnbu7 ylgnbu8 ylgnbu9
1424 ylorbr3 ylorbr4 ylorbr5 ylorbr6 ylorbr7 ylorbr8 ylorbr9
1426 ylorrd3 ylorrd4 ylorrd5 ylorrd6 ylorrd7 ylorrd8 ylorrd9
1428 color_names()
1430 my $names = Graph::Easy->color_names();
1431 Return a hash with name => value mapping for all known colors.
1433 text_style()
1435 if ($graph->text_style('bold, italic'))
1436 {
1437 ...
1438 }
1439 Checks the given style list for being valid.
1441 text_styles()
1443 my $styles = $graph->text_styles(); # or $edge->text_styles() etc.
1444 if ($styles->{'italic'})
1446 {
1447 print 'is italic\n';
1448 }
1449 Return a hash with the given text-style properties, aka 'underline',
1451 'bold' etc.
1452 text_styles_as_css()
1454 my $styles = $graph->text_styles_as_css(); # or $edge->...() etc.
1455 Return the text styles as a chunk of CSS styling that can be embedded
1457 into a " style="" " parameter.
1458 use_class()
1460 $graph->use_class('node', 'Graph::Easy::MyNode');
1461 Override the class to be used to constructs objects when calling
1463 "add_edge()", "add_group()" or "add_node()".
1464 The first parameter can be one of the following:
1466 node
1468 edge
1469 group
1470 Please see the documentation about "use_class()" in
1472 "Graph::Easy::Parser" for examples and details.
1473 animation_as_graph()
1475 my $graph_2 = $graph->animation_as_graph();
1476 print $graph_2->as_ascii();
1477 Returns the animation of $graph as a graph describing the flow of the
1479 animation. Useful for debugging animation flows.
1480 add_cycle()
1482 $graph->add_cycle('A','B','C'); # A -> B -> C -> A
1483 Compatibility method for Graph, adds the edges between each node and
1485 back from the last node to the first. Returns the graph.
1486 add_path()
1488 $graph->add_path('A','B','C'); # A -> B -> C
1489 Compatibility method for Graph, adds the edges between each node.
1491 Returns the graph.
1492 add_vertex()
1494 $graph->add_vertex('A');
1495 Compatibility method for Graph, adds the node and returns the graph.
1497 add_vertices()
1499 $graph->add_vertices('A','B');
1500 Compatibility method for Graph, adds these nodes and returns the graph.
1502 has_edge()
1504 $graph->has_edge('A','B');
1505 Compatibility method for Graph, returns true if at least one edge
1507 between A and B exists.
1508 vertices()
1510 Compatibility method for Graph, returns in scalar context the number of
1511 nodes this graph has, in list context a (arbitrarily sorted) list of
1512 node objects.
1513 set_vertex_attribute()
1515 $graph->set_vertex_attribute( 'A', 'fill', '#deadff' );
1516 Compatibility method for Graph, set the named vertex attribute.
1518 Please note that this routine will only accept Graph::Easy attribute
1520 names and values. If you want to attach custom attributes, you need to
1521 start their name with 'x-':
1522 $graph->set_vertex_attribute( 'A', 'x-foo', 'bar' );
1524 get_vertex_attribute()
1526 my $fill = $graph->get_vertex_attribute( 'A', 'fill' );
1527 Compatibility method for Graph, get the named vertex attribute.
1529 Please note that this routine will only accept Graph::Easy attribute
1531 names. See set_vertex_attribute().
1532
1534 Exports nothing.
1535
1537 Graph, Graph::Convert, Graph::Easy::As_svg, Graph::Easy::Manual and
1538 Graph::Easy::Parser.
1539 Related Projects
1541 Graph::Layout::Aesthetic, Graph and Text::Flowchart.
1542 There is also an very old, unrelated project from ca. 1995, which does
1544 something similar. See
1545 <http://rw4.cs.uni-sb.de/users/sander/html/gsvcg1.html>.
1546 Testcases and more examples under:
1548 <http://bloodgate.com/perl/graph/>.
1550
1552 This module is now quite complete, but there are still some
1553 limitations. Hopefully further development will lift these.
1554 Scoring
1556 Scoring is not yet implemented, each generated graph will be the same
1557 regardless of the random seed.
1558 Layouter
1560 The layouter can not yet handle links between groups (or between a
1561 group and a node, or vice versa). These links will thus only appear in
1562 as_graphviz() or as_txt() output.
1563 Paths
1565 No optimizations
1566 In complex graphs, non-optimal layout part like this one might
1567 appear:
1568 +------+ +--------+
1570 | Bonn | --> | Berlin | --> ...
1571 +------+ +--------+
1572 ^
1573 |
1574 |
1575 +---------+ |
1576 | Kassel | ---+
1577 +---------+
1578 A second-stage optimizer that simplifies these layouts is not yet
1580 implemented.
1581 In addition the general placement/processing strategy as well as the
1583 local strategy might be improved.
1584 attributes
1586 The following attributes are currently ignored by the layouter:
1587 undirected graphs
1589 autosplit/autojoin for edges
1590 tail/head label/title/link for edges
1591 groups
1593 The layouter is not fully recursive yet, so groups do not properly
1594 nest.
1595 In addition, links to/from groups are missing, too.
1597 Output formats
1599 Some output formats are not yet complete in their implementation.
1600 Please see the online manual at
1601 <http://bloodgate.com/perl/graph/manual> under "Output" for details.
1602
1604 This library is free software; you can redistribute it and/or modify it
1605 under the terms of the GPL 2.0 or a later version.
1606 See the LICENSE file for a copy of the GPL.
1608 This product includes color specifications and designs developed by
1610 Cynthia Brewer (http://colorbrewer.org/). See the LICENSE file for the
1611 full license text that applies to these color schemes.
1612
1614 The package was formerly known as "Graph::Simple". The name was changed
1615 for two reasons:
1616 • In graph theory, a "simple" graph is a special type of graph. This
1618 software, however, supports more than simple graphs.
1619 • Creating graphs should be easy even when the graphs are quite
1621 complex.
1622
1624 Copyright (C) 2004 - 2008 by Tels <http://bloodgate.com>
1625perl v5.36.0 2022-07-22 Graph::Easy(3)