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
//------------------------------------------------------------------------------
// LAGraph_Cached_NSelfEdges: count the # of diagonal entries of a graph
//------------------------------------------------------------------------------
// 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 Timothy A. Davis, Texas A&M University
//------------------------------------------------------------------------------
#include "LG_internal.h"
int LAGraph_Cached_NSelfEdges
(
// input/output:
LAGraph_Graph G, // graph to compute G->nself_edges
char *msg
)
{
//--------------------------------------------------------------------------
// clear msg and check G
//--------------------------------------------------------------------------
LG_CLEAR_MSG_AND_BASIC_ASSERT (G, msg) ;
// already computed
if (G->nself_edges != LAGRAPH_UNKNOWN)
{
return (GrB_SUCCESS) ;
}
//--------------------------------------------------------------------------
// compute G->nself_edges
//--------------------------------------------------------------------------
return (LG_nself_edges (&G->nself_edges, G->A, msg)) ;
}