src/adjlist_algorithm.h
Go to the documentation of this file.
00001 #ifndef _DJS_ADJLIST_ALGORITHM_H_ 00002 #define _DJS_ADJLIST_ALGORITHM_H_ 00003 /* 00004 This program is free software: you can redistribute it and/or modify 00005 it under the terms of the GNU General Public License as published by 00006 the Free Software Foundation, either version 3 of the License, or 00007 (at your option) any later version. 00008 00009 This program is distributed in the hope that it will be useful, 00010 but WITHOUT ANY WARRANTY; without even the implied warranty of 00011 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 00012 GNU General Public License for more details. 00013 00014 You should have received a copy of the GNU General Public License 00015 along with this program. If not, see <http://www.gnu.org/licenses/> 00016 */ 00017 00018 #include<assert.h> 00019 #include<stdio.h> 00020 #include<stdlib.h> 00021 #include<string.h> 00022 00023 #include"misc.h" 00024 #include"LinkedList.h" 00025 #include"MemoryManager.h" 00026 00044 long listAllMaximalCliquesAdjacencyList( LinkedList** adjList, 00045 int** adjacencyList, 00046 #ifdef RETURN_CLIQUES_ONE_BY_ONE 00047 LinkedList* cliques, 00048 #endif 00049 int* degree, 00050 int size); 00051 00052 int findBestPivotNonNeighborsAdjacencyList( int** pivotNonNeighbors, int* numNonNeighbors, 00053 int** adjacencyList, int* degree, 00054 int* vertexSets, int* vertexLookup, int size, 00055 int beginX, int beginP, int beginR); 00056 00057 void listAllMaximalCliquesAdjacencyListRecursive( long* cliqueCount, 00058 #ifdef RETURN_CLIQUES_ONE_BY_ONE 00059 LinkedList* cliques, 00060 #endif 00061 LinkedList* partialClique, 00062 int** adjacencyList, int* degree, 00063 int* vertexSets, int* vertexLookup, int size, 00064 int beginX, int beginR, int beginP); 00065 00066 #endif
