Bpp/Graph_problem
Serial_parallel
C++
 
 
DESCRIPTION
 

This module provides facilities for serial-parallel graphs.

 
SOURCE FILES
 

This section allows you to access the C++ source files of the module.

 
PARENT MODULE
 

This module is part of Bpp/Graph_problem.

 
INCLUDED FILES
 

The files listed below are included in the interface part of the module. So any module dependent of this module is also dependent of the files listed here.

  • <deque>

  • <bpp/graph.hpp>

 
NEEDED FILES
 

The files listed below are needed by the implementation part of the module. But a module dependent of this module is not necessary dependent of the files listed here.

  • <bpp/modules.hpp>

 
INTEGRATED NAMESPACES
 

The namespaces listed below are integrated in this module. That means any element declared in one of those namespaces can now be directly used by or from this module.

  • graph

 
ALIASES
 

The aliases listed below are only used internally by the interface. They are here just to lighten the writing of certain declarations. Never use them, they are local to the interface and can not be used outside of it.

  • tdGraph = class prArcData,class prNodeData

  • tuGraph = prArcData,prNodeData

 
ERRORS
 

Here are listed the errors that are supported or generated by the module. To use one of them, you do not have to specify the namespace of the module.

  • erArcGraphAssociationProblem
    Can not associate the arc with the graph.

  • erNotSerialParallel
    The graph is not serial-parallel.

  • erSplitNotFound
    Split of the tree not found.

 
FUNCTIONS
 

Here are listed the functions provided by the module. To use one of them, you have to specify the namespace of the module.

 
CLASSES
 

Here are listed the classes provided by the module. To use one of them, you have to specify the namespace of the module.

 
clDecomposeAlgo
 
 
Declaration

template <tdGraph> class clDecomposeAlgo

 
Description

Represents an algorithm to decompose a graph into serial-parallel components. The components are trees that represent the serial-parallel structure of the graph. A node in these trees is either a serial operation, a parallel operation or an arc. If the graph is serial-parallel, there is only one generated tree. It is an abstract class.

 
Methods
 
clDecomposeAlgoI
 
 
Declaration

template <tdGraph> class clDecomposeAlgoI : public clDecomposeAlgo<tuGraph>

 
Description

Represents the method I to decompose a graph into serial-parallel components.

 
Methods
 
clDecomposeAlgoII
 
 
Declaration

template <tdGraph> class clDecomposeAlgoII : public clDecomposeAlgo<tuGraph>

 
Description

Represents the method II to decompose a graph into serial-parallel components.

 
Methods
 
clDecomposeAlgoIII
 
 
Declaration

template <tdGraph> class clDecomposeAlgoIII : public clDecomposeAlgo<tuGraph>

 
Description

Represents the method III to decompose a graph into serial-parallel components.

 
Methods
 
clSerialParallelData
 
 
Declaration

template <tdGraph> class clSerialParallelData

 
Description

Represents the data carried by a binary tree representing a serial-parallel component of a graph.

 
Types
  • type clArc<tuGraph> * cpArc
    Type of an arc.

  • enumeration { none , serial , parallel } tyOperation
    Enumeration of the construction operations.

 
Attributes
  • cpArc arc()
    Pointer to an arc, if there is no operation. Reading and writing access.

  • tyOperation operation()
    Construction operation. Reading and writing access.

 
Methods
 
 
Copyright (c) 1999-2016 - Bruno Bachelet - bruno@nawouak.net - http://www.nawouak.net
Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.1 or any later version published by the Free Software Foundation. See this license for more details (http://www.gnu.org).