void _K33Search_ReinitializeGraph(graphP theGraph)
{
K33SearchContext *context = NULL;
gp_FindExtension(theGraph, K33SEARCH_ID, (void *)&context);
if (context != NULL)
{
// Reinitialize the graph
context->functions.fpReinitializeGraph(theGraph);
// Do the reinitialization that is specific to this module
_K33Search_InitStructures(context);
LCReset(context->separatedDFSChildLists);
LCReset(context->bin);
}
}
void _K33Search_ReinitializeGraph(graphP theGraph)
{
K33SearchContext *context = NULL;
gp_FindExtension(theGraph, K33SEARCH_ID, (void *)&context);
if (context != NULL)
{
// Reinitialization can go much faster if the underlying
// init graph node and vertex rec functions are called,
// rather than the overloads of this module, because it
// avoids lots of unnecessary gp_FindExtension() calls.
if (theGraph->functions.fpInitGraphNode == _K33Search_InitGraphNode &&
theGraph->functions.fpInitVertexRec == _K33Search_InitVertexRec)
{
// Restore the graph function pointers
theGraph->functions.fpInitGraphNode = context->functions.fpInitGraphNode;
theGraph->functions.fpInitVertexRec = context->functions.fpInitVertexRec;
// Reinitialize the graph
context->functions.fpReinitializeGraph(theGraph);
// Restore the function pointers that attach this feature
theGraph->functions.fpInitGraphNode = _K33Search_InitGraphNode;
theGraph->functions.fpInitVertexRec = _K33Search_InitVertexRec;
// Do the reinitialization that is specific to this module
_K33Search_InitStructures(context);
LCReset(context->sortedDFSChildLists);
}
// If optimization is not possible, then just stick with what works.
// Reinitialize the graph-level structure and then invoke the
// reinitialize function.
else
{
LCReset(context->sortedDFSChildLists);
// The underlying function fpReinitializeGraph() implicitly initializes the K33
// structures due to the overloads of fpInitGraphNode() and fpInitVertexRec().
// It just does so less efficiently because each invocation of InitGraphNode
// and InitVertexRec has to look up the extension again.
//// _K33Search_InitStructures(context);
context->functions.fpReinitializeGraph(theGraph);
}
}
}
int _K33Search_InitGraph(graphP theGraph, int N)
{
K33SearchContext *context = NULL;
gp_FindExtension(theGraph, K33SEARCH_ID, (void *)&context);
if (context == NULL)
return NOTOK;
theGraph->N = N;
theGraph->NV = N;
if (theGraph->arcCapacity == 0)
theGraph->arcCapacity = 2*DEFAULT_EDGE_LIMIT*N;
if (_K33Search_CreateStructures(context) != OK ||
_K33Search_InitStructures(context) != OK)
return NOTOK;
context->functions.fpInitGraph(theGraph, N);
return OK;
}
int gp_AttachK33Search(graphP theGraph)
{
K33SearchContext *context = NULL;
// If the K3,3 search feature has already been attached to the graph,
// then there is no need to attach it again
gp_FindExtension(theGraph, K33SEARCH_ID, (void *)&context);
if (context != NULL)
{
return OK;
}
// Allocate a new extension context
context = (K33SearchContext *) malloc(sizeof(K33SearchContext));
if (context == NULL)
{
return NOTOK;
}
// First, tell the context that it is not initialized
context->initialized = 0;
// Save a pointer to theGraph in the context
context->theGraph = theGraph;
// Put the overload functions into the context function table.
// gp_AddExtension will overload the graph's functions with these, and
// return the base function pointers in the context function table
memset(&context->functions, 0, sizeof(graphFunctionTable));
context->functions.fpEmbeddingInitialize = _K33Search_EmbeddingInitialize;
context->functions.fpEmbedBackEdgeToDescendant = _K33Search_EmbedBackEdgeToDescendant;
context->functions.fpMergeBicomps = _K33Search_MergeBicomps;
context->functions.fpMergeVertex = _K33Search_MergeVertex;
context->functions.fpHandleBlockedBicomp = _K33Search_HandleBlockedBicomp;
context->functions.fpEmbedPostprocess = _K33Search_EmbedPostprocess;
context->functions.fpCheckEmbeddingIntegrity = _K33Search_CheckEmbeddingIntegrity;
context->functions.fpCheckObstructionIntegrity = _K33Search_CheckObstructionIntegrity;
context->functions.fpInitGraph = _K33Search_InitGraph;
context->functions.fpReinitializeGraph = _K33Search_ReinitializeGraph;
context->functions.fpEnsureArcCapacity = _K33Search_EnsureArcCapacity;
_K33Search_ClearStructures(context);
// Store the K33 search context, including the data structure and the
// function pointers, as an extension of the graph
if (gp_AddExtension(theGraph, &K33SEARCH_ID, (void *) context,
_K33Search_DupContext, _K33Search_FreeContext,
&context->functions) != OK)
{
_K33Search_FreeContext(context);
return NOTOK;
}
// Create the K33-specific structures if the size of the graph is known
// Attach functions are always invoked after gp_New(), but if a graph
// extension must be attached before gp_Read(), then the attachment
// also happens before gp_InitGraph(), which means N==0.
// However, sometimes a feature is attached after gp_InitGraph(), in
// which case N > 0
if (theGraph->N > 0)
{
if (_K33Search_CreateStructures(context) != OK ||
_K33Search_InitStructures(context) != OK)
{
_K33Search_FreeContext(context);
return NOTOK;
}
}
return OK;
}
