Go to the documentation of this file.00001 #ifndef _DJS_TOMITA_ALGORITHM_H
00002 #define _DJS_TOMITA_ALGORITHM_H
00003
00004
00005
00006
00007
00008
00009
00010
00011
00012
00013
00014
00015
00016
00017
00018
00019 #include<assert.h>
00020 #include<stdio.h>
00021 #include<stdlib.h>
00022
00023 #include"misc.h"
00024 #include"LinkedList.h"
00025 #include"MemoryManager.h"
00026
00044 long listAllMaximalCliquesMatrix( char** adjacencyMatrix,
00045 #ifdef RETURN_CLIQUES_ONE_BY_ONE
00046 LinkedList* cliques,
00047 #endif
00048 int numVertices );
00049
00050
00051 int findBestPivotNonNeighborsMatrix( int** pivotNonNeighbors, int* numNonNeighbors,
00052 char** adjacencyMatrix,
00053 int* vertexSets, int* vertexLookup, int size,
00054 int beginX, int beginP, int beginR);
00055
00056 void listAllMaximalCliquesMatrixRecursive( long* cliqueCount,
00057 #ifdef RETURN_CLIQUES_ONE_BY_ONE
00058 LinkedList* cliques,
00059 #endif
00060 LinkedList* partialClique,
00061 char** adjacencyMatrix,
00062 int* vertexSets, int* vertexLookup, int size,
00063 int beginX, int beginP, int beginR );
00064
00065
00066 #endif