sparseBiGraph Class Reference

A class for bipartite graphs represented with incidence lists. More...

#include <sparseBigraph.h>

Inheritance diagram for sparseBiGraph:

abstractBiGraph abstractGraph abstractMixedGraph managedObject goblinRootObject inducedBigraph

Public Member Functions

 sparseBiGraph (TNode _n1=0, TNode _n2=0, goblinController &_CT=goblinDefaultContext) throw ()
 sparseBiGraph (const char *fileName, goblinController &_CT=goblinDefaultContext) throw (ERFile,ERParse)
 sparseBiGraph (abstractBiGraph &G, TOption options=0) throw ()
 ~sparseBiGraph () throw ()
unsigned long Size () const throw ()
unsigned long Allocated () const throw ()
TNode SwapNode (TNode u) throw (ERRange,ERRejected)

Protected Attributes

sparseRepresentation X

Detailed Description

A class for bipartite graphs represented with incidence lists.


Constructor & Destructor Documentation

sparseBiGraph TNode  _n1 = 0,
TNode  _n2 = 0,
goblinController _CT = goblinDefaultContext
throw ()
 

Default constructor for sparse bigraphs.

Parameters:
_n1 The initial number of left-hand nodes
_n2 The initial number of right-hand nodes
_CT The context to which this graph object is attached

sparseBiGraph const char *  fileName,
goblinController _CT = goblinDefaultContext
throw (ERFile,ERParse)
 

File constructor for sparse bigraphs.

Parameters:
fileName The source file name
_CT The context to which this graph object is attached

sparseBiGraph abstractBiGraph G,
TOption  options = 0
throw ()
 

Copy constructor for sparse bigraphs.

Parameters:
G The original bigraph object
options A combination of OPT_CLONE, OPT_PARALLELS, OPT_MAPPINGS and OPT_SUB

~sparseBiGraph  )  throw ()
 


Member Function Documentation

unsigned long Allocated  )  const throw ()
 

Reimplemented from abstractBiGraph.

unsigned long Size  )  const throw () [virtual]
 

Implements goblinRootObject.

TNode SwapNode TNode  u  )  throw (ERRange,ERRejected)
 

Move a node from one partition to another.

Parameters:
u A node index ranged [0,1,..,n-1]
This moves u from the left-hand side to the right-hand side or vice versa. It is required that u is an isolated node.


Field Documentation

sparseRepresentation X [protected]