-
Notifications
You must be signed in to change notification settings - Fork 1
/
graph.h
52 lines (42 loc) · 1.87 KB
/
graph.h
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
#ifndef __GRAPH_H
#define __GRAPH_H
/**
This file is part of exactcolors.
exactcolors is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
exactcolors is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with exactcolors. If not, see <http://www.gnu.org/licenses/>.
*/
typedef struct COLORadjnode {
int* adj;
int degree;
int color;
} COLORadjnode;
typedef struct COLORadjgraph {
COLORadjnode* nodelist;
int* adjspace;
int ncount;
int ecount;
} COLORadjgraph;
int COLORadjgraph_build(COLORadjgraph* G,int ncount,int ecount, const int elist[]);
int COLORadjgraph_copy(COLORadjgraph* Gdst, const COLORadjgraph* Gsrc);
int COLORadjgraph_delete_unweighted(COLORadjgraph* G, int** new_nweights,
const int nweights[]);
int COLORadjgraph_build_complement(COLORadjgraph* Gc, const COLORadjgraph* G);
void COLORadjgraph_init(COLORadjgraph* G);
void COLORadjgraph_free(COLORadjgraph* G);
int COLORadjgraph_simplify(COLORadjgraph* G);
int COLORadjgraph_extract_edgelist(int* ecount, int* elist[], const COLORadjgraph* G);
void COLORadjgraph_sort_adjlists_by_id(COLORadjgraph* G);
int COLORread_dimacs (char *f, int *pncount, int *pecount, int **pelist,
int **pnweights);
int COLORedge_stat(const COLORadjgraph* G);
int COLORgraph_print(int ecount, const int elist[]);
int COLORcheck_connectedness(const COLORadjgraph* G);
#endif