Series-parallel graphs
[Manipulating node incidence orders]


Enumerations

enum  abstractMixedGraph::TOptSeriesParallel {
  abstractMixedGraph::ESP_UNDIRECTED = 0,
  abstractMixedGraph::ESP_DIRECTED = 1,
  abstractMixedGraph::ESP_EMBEDDING = 2,
  abstractMixedGraph::ESP_ORIENT = 4,
  abstractMixedGraph::ESP_VISIBILITY = 8,
  abstractMixedGraph::ESP_MINOR = 16
}

Functions

bool abstractMixedGraph::EdgeSeriesParallelMethod (TOptSeriesParallel options=ESP_EMBEDDING, TNode s=NoNode, TNode t=NoNode, abstractMixedGraph *_T=NULL) throw (ERRejected)
abstractMixedGraph * abstractMixedGraph::ESP_DecompositionTree (TOptSeriesParallel options=ESP_DIRECTED, TNode s=NoNode, TNode t=NoNode) throw ()

Enumeration Type Documentation

enum TOptSeriesParallel [inherited]
 

Options for series-parallelity methods.

Enumerator:
ESP_UNDIRECTED  Ignore the original arc orientations.
ESP_DIRECTED  Respect the original arc orientations.
ESP_EMBEDDING  Reorder the node incidence.
ESP_ORIENT  Set the arc orientations according to the decomposition.
ESP_VISIBILITY  Draw the graph by a 1-visibility representation.
ESP_MINOR  In the graph is not series-parallel, export a forbidden minor.

Function Documentation

bool EdgeSeriesParallelMethod (  TOptSeriesParallel  options = ESP_EMBEDDING,
TNode  s = NoNode,
TNode  t = NoNode,
abstractMixedGraph *  _T = NULL
)  throw (ERRejected) [inherited]
 

Handling of edge series-parallel graphs.

Parameters:
options Any bit combination of the TOptSeriesParallel options
s The source node if the graph can been reduced to a single edge
t The target node if the graph can been reduced to a single edge
_T One can pass a binary decomposition tree here
Return values:
true The graph could be decomposed
Manipulate edge series parallel graphs according to a given decomposition tree and / or call the edge series parallel recognition method

abstractMixedGraph * ESP_DecompositionTree (  TOptSeriesParallel  options = ESP_DIRECTED,
TNode  s = NoNode,
TNode  t = NoNode
)  throw () [inherited]
 

Recognition of edge series-parallel graphs.

Parameters:
options Either ESP_DIRECTED or ESP_UNDIRECTED
s The source node if the graph can been reduced to a single edge
t The target node if the graph can been reduced to a single edge
Returns:
A pointer to the decomposition tree or NULL
This method checks if the graph is edge series parallel and generates an according binary decomposition tree. The leave nodes of this tree are the original edges and the node colours encode node types and arc orientations.