Tristan Colombo > BioGraph-1.0.1 > BioGraph::Operation

Download:
BioGraph/BioGraph-1.0.1.tar.gz

Dependencies

Annotate this POD

CPAN RT

Open  0
Report a bug
Module Version: 1.0.1   Source  

NAME ^

BioGraph::Operation

SYNOPSIS ^

use BioGraph::Operation;

DESCRIPTION ^

Package for manipulate graphs represented as well as adjacent matrix or adjacent list. Library for graph operations such as copy, modification, ...

AVAILABLE FUNCTIONS ^

This is the list of the differents functions implemented in this library.

copy_graph

Copy a graph.

  • SYNOPSIS %T=copy_graph(representation, graph)
  • PARAMETERS
    representation

    the type of representation choosen : 1 = adjacent matrix, and 2 = adjacent list

    graph

    the hash table of the graph

  • OUTPUT The copied graph (you can use directly %T2=%T instead of this function but in this case, the modifications on %T will affect %T2).
cut_edge

Cut an edge of the graph

  • SYNOPSIS %G=cut_edge(representation, vertex_start, vertex_end, graph)
  • PARAMETERS
    representation

    the type of representation choosen : 1 = adjacent matrix, and 2 = adjacent list

    vertex_start

    start vertex

    vertex_end

    end vertex ('start - end' is an edge)

    graph

    the hash table of the graph

  • OUTPUT The graph without the edge 'start - end'
cut_vertex

Cut a vertex of the graph

  • SYNOPSIS %G=cut_vertex(representation, vertex_to_cut, graph)
  • PARAMETERS
    representation

    the type of representation choosen : 1 = adjacent matrix, and 2 = adjacent list

    vertex_to_cut

    the vertex to cut

    graph

    the hash table of the graph

  • OUTPUT The graph without the vertex 'vertex_to_cut'
symetric

Compute the symetric graph Gs associated to G

  • SYNOPSIS %Gs=symetric(representation, graph)
  • PARAMETERS
    representation

    the type of representation choosen : 1 = adjacent matrix, and 2 = adjacent list

    graph

    the hash table of the graph

  • OUTPUT The symetrised graph associated to G (called Gs)
compute_CC

Compute the number connected components of a graph and if selected, create them

  • SYNOPSIS $N=compute_CC(representation, create_file, file_name, graph)
  • PARAMETERS
    representation

    the type of representation choosen : 1 = adjacent matrix, and 2 = adjacent list

    create_file

    enable (or not) the creation of a file for each connected component : 0 = disable, 1 = enable

    <file_name>

    basename of the files (ex: graph => graph_CCx.gr) ; if create_file=0, then indicate "" (or everything else) as file_name

    <graph>

    the hash table of the graph

  • OUTPUT The number of connected components and if selected, the files of the CC in format graph (.gr).

AUTHOR AND COPYRIGHT ^

  Graph::Operation is Copyright (C) 2004, Tristan Colombo
                                     CNRS - LCB, 31 chemin Joseph Aiguier
                                     13009 Marseille
                                     France

                                     Email: tristan.colombo@ibsm.cnrs-mrs.fr

  All rights reserved.

  You may distribute this package under the terms of either the GNU
  General Public License or the Artistic License, as specified in the
  Perl README file.