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
|
//----------------------------------------------------------------------------
// LAGraph/src/test/test_HelloWorld.c: test cases for LAGraph_HelloWorld
//----------------------------------------------------------------------------
// 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
//-----------------------------------------------------------------------------
// This is a very simple "hello world" example of a test program for an
// algorithm in the experimental/algorithm folder.
#include <stdio.h>
#include <acutest.h>
#include <LAGraphX.h>
#include <LAGraph_test.h>
#include <LG_Xtest.h>
#include <LG_test.h>
char msg [LAGRAPH_MSG_LEN] ;
LAGraph_Graph G = NULL ;
#define LEN 512
char filename [LEN+1] ;
void test_HelloWorld (void)
{
//--------------------------------------------------------------------------
// start LAGraph
//--------------------------------------------------------------------------
LAGraph_Init (msg) ;
GrB_Matrix Y = NULL, A = NULL ;
//--------------------------------------------------------------------------
// test with the west0067 matrix
//--------------------------------------------------------------------------
// create the graph
snprintf (filename, LEN, LG_DATA_DIR "%s", "west0067.mtx") ;
FILE *f = fopen (filename, "r") ;
TEST_CHECK (f != NULL) ;
OK (LAGraph_MMRead (&A, f, msg)) ;
OK (fclose (f)) ;
OK (LAGraph_New (&G, &A, LAGraph_ADJACENCY_DIRECTED, msg)) ;
TEST_CHECK (A == NULL) ; // A has been moved into G->A
// test the algorithm
OK (LAGraph_HelloWorld (&Y, G, msg)) ;
// print the result
printf ("\nOutput of LAGraph_HelloWorld:\n") ;
OK (LAGraph_Matrix_Print (Y, LAGraph_COMPLETE, stdout, msg)) ;
// check the result (ensure Y is equal to G->A)
bool ok ;
OK (LAGraph_Matrix_IsEqual (&ok, Y, G->A, msg)) ;
TEST_CHECK (ok) ;
//--------------------------------------------------------------------------
// free everything and finalize LAGraph
//--------------------------------------------------------------------------
OK (GrB_free (&Y)) ;
OK (LAGraph_Delete (&G, msg)) ;
LAGraph_Finalize (msg) ;
}
//----------------------------------------------------------------------------
// the make program is created by acutest, and it runs a list of tests:
//----------------------------------------------------------------------------
TEST_LIST =
{
{"HelloWorld", test_HelloWorld}, // just one test in this example
{NULL, NULL}
} ;
|
