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
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
|
//----------------------------------------------------------------------------
// LAGraph/expirimental/test/test_KCoreDecompose.c: test cases for k-core
// decomposition
// ----------------------------------------------------------------------------
// LAGraph, (c) 2019-2022 by The LAGraph Contributors, All Rights Reserved.
// SPDX-License-Identifier: BSD-2-Clause
//
// For additional details (including references to third party source code and
// other files) see the LICENSE file or contact permission@sei.cmu.edu. See
// Contributors.txt for a full list of contributors. Created, in part, with
// funding and support from the U.S. Government (see Acknowledgments.txt file).
// DM22-0790
// Contributed by Pranav Konduri, Texas A&M University
//-----------------------------------------------------------------------------
#include <stdio.h>
#include <acutest.h>
#include <LAGraphX.h>
#include <LAGraph_test.h>
#include "LG_Xtest.h"
char msg [LAGRAPH_MSG_LEN] ;
LAGraph_Graph G = NULL ;
GrB_Matrix A = NULL, D1 = NULL, D2 = NULL;
GrB_Vector c = NULL;
#define LEN 512
char filename [LEN+1] ;
typedef struct
{
uint64_t kval ;
const char *name ;
}
matrix_info ;
const matrix_info files [ ] =
{
{ 4, "karate.mtx" },
{ 6, "west0067.mtx" },
// { 10, "amazon0601.mtx" },
// { 64, "cit-Patents.mtx"},
// { 2208, "hollywood-2009.mtx"},
// { 111, "as-Skitter.mtx"},
{ 0, "" },
} ;
void test_KCoreDecompose (void)
{
LAGraph_Init (msg) ;
#if LAGRAPH_SUITESPARSE
for (int k = 0 ; ; k++)
{
// load the matrix as A
const char *aname = files [k].name ;
uint64_t kval = files [k].kval ;
if (strlen (aname) == 0) break;
TEST_CASE (aname) ;
snprintf (filename, LEN, LG_DATA_DIR "%s", aname) ;
FILE *f = fopen (filename, "r") ;
TEST_CHECK (f != NULL) ;
OK (LAGraph_MMRead (&A, f, msg)) ;
TEST_MSG ("Loading of adjacency matrix failed") ;
// construct an undirected graph G with adjacency matrix A
OK (LAGraph_New (&G, &A, LAGraph_ADJACENCY_DIRECTED, msg)) ;
TEST_CHECK (A == NULL) ;
// check if the pattern is symmetric - if it isn't make it.
OK (LAGraph_Cached_IsSymmetricStructure (G, msg)) ;
if (G->is_symmetric_structure == LAGraph_FALSE)
{
printf("This matrix is not symmetric. \n");
// make the adjacency matrix symmetric
OK (LAGraph_Cached_AT (G, msg)) ;
OK (GrB_eWiseAdd (G->A, NULL, NULL, GrB_LOR, G->A, G->AT, NULL)) ;
G->is_symmetric_structure = true ;
// consider the graph as directed
G->kind = LAGraph_ADJACENCY_DIRECTED ;
}
else
{
G->kind = LAGraph_ADJACENCY_UNDIRECTED ;
}
// check for self-edges, and remove them.
OK (LAGraph_Cached_NSelfEdges (G, msg)) ;
if (G->nself_edges != 0)
{
// remove self-edges
printf ("graph has %g self edges\n", (double) G->nself_edges) ;
OK (LAGraph_DeleteSelfEdges (G, msg)) ;
printf ("now has %g self edges\n", (double) G->nself_edges) ;
TEST_CHECK (G->nself_edges == 0) ;
}
bool ok;
//get the kcore at the designated k-value
LAGraph_KCore(&c, G, kval, msg) ;
//decompose the k-core from vector c into D1
LAGraph_KCore_Decompose(&D1, G, c, kval, msg);
//decompose the k-core from vector c into D2
LG_check_kcore_decompose(&D2, G, c, kval, msg);
//check equality
OK (LAGraph_Matrix_IsEqual (&ok, D1, D2, msg)) ;
TEST_CHECK(ok);
OK (LAGraph_Delete (&G, msg)) ;
}
#endif
LAGraph_Finalize (msg) ;
}
//------------------------------------------------------------------------------
// test_errors
//------------------------------------------------------------------------------
void test_errors (void)
{
LAGraph_Init (msg) ;
#if LAGRAPH_SUITESPARSE
snprintf (filename, LEN, LG_DATA_DIR "%s", "karate.mtx") ;
FILE *f = fopen (filename, "r") ;
TEST_CHECK (f != NULL) ;
OK (LAGraph_MMRead (&A, f, msg)) ;
TEST_MSG ("Loading of adjacency matrix failed") ;
// construct an undirected graph G with adjacency matrix A
OK (LAGraph_New (&G, &A, LAGraph_ADJACENCY_UNDIRECTED, msg)) ;
TEST_CHECK (A == NULL) ;
OK (LAGraph_Cached_NSelfEdges (G, msg)) ;
uint64_t kval = 2 ;
GrB_Vector c = NULL ;
// c is NULL
int result = LAGraph_KCore_Decompose (&D1, G, NULL, kval, msg) ;
printf ("\nresult: %d %s\n", result, msg) ;
TEST_CHECK (result == GrB_NULL_POINTER) ;
// G is invalid
result = LAGraph_KCore_Decompose (&D1, NULL, c, kval, msg) ;
printf ("\nresult: %d %s\n", result, msg) ;
TEST_CHECK (result == GrB_NULL_POINTER) ;
TEST_CHECK (c == NULL) ;
// G may have self edges
G->nself_edges = LAGRAPH_UNKNOWN ;
result = LAGraph_KCore_Decompose(&D1, G, c, kval, msg);
printf ("\nresult: %d %s\n", result, msg) ;
TEST_CHECK (result == -1004) ;
TEST_CHECK (c == NULL) ;
// G is directed
G->nself_edges = 0 ;
G->kind = LAGraph_ADJACENCY_DIRECTED ;
G->is_symmetric_structure = LAGraph_FALSE ;
result = LAGraph_KCore_Decompose(&D1, G, c, kval, msg);
printf ("\nresult: %d %s\n", result, msg) ;
TEST_CHECK (result == -1005) ;
TEST_CHECK (c == NULL) ;
result = LG_check_kcore_decompose(&D1, G, c, kval, msg);
printf ("\nresult: %d %s\n", result, msg) ;
TEST_CHECK (result == -1005) ;
TEST_CHECK (c == NULL) ;
OK (LAGraph_Delete (&G, msg)) ;
#endif
LAGraph_Finalize (msg) ;
}
TEST_LIST = {
#if LAGRAPH_SUITESPARSE
{"KCoreDecompose", test_KCoreDecompose},
{"KCoreDecompose_errors", test_errors},
#endif
{NULL, NULL}
};
|
