intervalGraph Class Reference
[Graph series]

Interval graph. More...

#include <sparseGraph.h>

Inheritance diagram for intervalGraph:

Public Member Functions
	intervalGraph (TNode numNodes, TFloat *minRange, TFloat *maxRange, goblinController &_CT=goblinDefaultContext) throw ()
	intervalGraph (TNode numNodes, TIndex valueRange, goblinController &_CT=goblinDefaultContext) throw ()

---

Detailed Description

Interval graph.

---

Constructor & Destructor Documentation

intervalGraph (  TNode  numNodes, TFloat *  minRange, TFloat *  maxRange, goblinController &  _CT = goblinDefaultContext )  throw ()

Generate an interval graph. Parameters: numNodes  The number of nodes minRange  An array of interval minima maxRange  An array of interval maxima _CT  The controller object to manage the created graph This generates a graph with the specified number of nodes and arcs (u,v) if the intervals [minRange[u],..,maxRange[u]] and [minRange[v],..,maxRange[v]] are not disjoint - including the case maxRange[u]==minRange[v].

intervalGraph (  TNode  numNodes, TIndex  valueRange, goblinController &  _CT = goblinDefaultContext )  throw ()

Generate a random interval graph. Parameters: numNodes  The number of nodes valueRange  The value range of node intervals _CT  The controller object to manage the created graph This generates a graph with the specified number of nodes and arcs (u,v) if the intervals [minRange[u],..,maxRange[u]] and [minRange[v],..,maxRange[v]] are not disjoint - including the case maxRange[u]==minRange[v]. The intervals [minRange[v],..,maxRange[v]] are random subset intervals of [0,..,valueRange-1]