Linux and UNIX Man Pages

Linux & Unix Commands - Search Man Pages

graph::writer(3pm) [debian man page]

Graph::Writer(3pm)					User Contributed Perl Documentation					Graph::Writer(3pm)

NAME
Graph::Writer - base class for Graph file format writers SYNOPSIS
package Graph::Writer::MyFormat; use Graph::Writer; use vars qw(@ISA); @ISA = qw(Graph::Writer); sub _write_graph { my ($self, $graph, $FILE) = @_; # write $graph to $FILE } DESCRIPTION
Graph::Writer is a base class for Graph file format writers. A particular subclass of Graph::Writer will handle a specific file format, and generate a Graph, represented using Jarkko Hietaniemi's Graph class. You should never create an instance of this class yourself, it is only meant for subclassing. If you try to create an instance of Graph::Writer, the constructor will throw an exception. METHODS
new() Constructor - generate a new writer instance. This is a virtual method, or whatever the correct lingo is. You're not meant to call this on the base class, it is inherited by the subclasses. Ie if you do something like: $writer = Graph::Writer->new(); It will throw an exception. write_graph() Read a graph from the specified file: $graph = $writer->write_graph($file); The $file argument can either be a filename, or a filehandle for a previously opened file. SUBCLASSING
To create your own graph format writer, create a module which subclasses Graph::Writer. For example, suppose DGF is a directed graph format - create a Graph::Writer::DGF module, with the following structure: package Graph::Writer::DGF; use Graph::Writer; use vars qw(@ISA); @ISA = qw(Graph::Writer); sub _write_graph { my $self = shift; my $graph = shift; my $FILE = shift; while (<$FILE>) { } return 1; } 1; Note the leading underscore on the _write_graph() method. The base class provides the public method, and invokes the private method which you're expected to provide, as above. If you want to perform additional initialisation at construction time, you can provide an _init() method, which will be invoked by the base class's constructor. You should invoke the superclass's initialiser as well, as follows: sub _init { my $self = shift; $self->SUPER::_init(); # your initialisation here } Someone can then use your class as follows: use Graph::Writer::DGF; $writer = Graph::Writer::DGF->new(); $writer->write_graph($graph, 'foo.dgf'); SEE ALSO
Graph Jarkko Hietaniemi's modules for representing directed graphs, available from CPAN under modules/by-module/Graph/ Algorithms in Perl The O'Reilly book has a chapter on directed graphs, which is based around Jarkko's modules. Graph::Writer::Dot A simple subclass of this class for writing graphs in the file format used by dot, which is part of the graphviz package from AT&T. Graph::Writer::VCG A simple subclass of this class for writing graphs in the file format used by VCG, a tool for visualising directed graphs, initially developed for visualising compiler graphs. Graph::Writer::XML A simple subclass of this class for writing graphs as XML, using a simple graph markup. Graph::Reader A baseclass for Graph file format readers. AUTHOR
Neil Bowers <neil@bowers.com> 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. perl v5.14.2 2012-02-14 Graph::Writer(3pm)

Check Out this Related Man Page

Graph::UnionFind(3pm)					User Contributed Perl Documentation				     Graph::UnionFind(3pm)

NAME
Graph::UnionFind - union-find data structures SYNOPSIS
use Graph::UnionFind; my $uf = Graph::UnionFind->new; # Add the vertices to the data structure. $uf->add($u); $uf->add($v); # Join the partitions of the vertices. $uf->union( $u, $v ); # Find the partitions the vertices belong to # in the union-find data structure. If they # are equal, they are in the same partition. # If the vertex has not been seen, # undef is returned. my $pu = $uf->find( $u ); my $pv = $uf->find( $v ); $uf->same($u, $v) # Equal to $pu eq $pv. # Has the union-find seen this vertex? $uf->has( $v ) DESCRIPTION
Union-find is a special data structure that can be used to track the partitioning of a set into subsets (a problem known also as disjoint sets). Graph::UnionFind() is used for Graph::connected_components(), Graph::connected_component(), and Graph::same_connected_components() if you specify a true "union_find" parameter when you create an undirected graph. Note that union-find is one way: you cannot (easily) 'ununion' vertices once you have 'unioned' them. This means that if you delete edges from a "union_find" graph, you will get wrong results from the Graph::connected_components(), Graph::connected_component(), and Graph::same_connected_components(). API add $uf->add($v) Add the vertex v to the union-find. union $uf->union($u, $v) Add the edge u-v to the union-find. Also implicitly adds the vertices. has $uf->has($v) Return true if the vertex v has been added to the union-find, false otherwise. find $uf->find($v) Return the union-find partition the vertex v belongs to, or "undef" if it has not been added. new $uf = Graph::UnionFind->new() The constructor. same $uf->same($u, $v) Return true of the vertices belong to the same union-find partition the vertex v belongs to, false otherwise. AUTHOR AND COPYRIGHT
Jarkko Hietaniemi jhi@iki.fi LICENSE
This module is licensed under the same terms as Perl itself. perl v5.10.0 2008-11-27 Graph::UnionFind(3pm)
Man Page