tlds
Transactional Operations for Linked Data Structures
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros
findSubGraphs.h
Go to the documentation of this file.
1 /* =============================================================================
2  *
3  * findSubGraphs.h
4  *
5  * =============================================================================
6  *
7  * For the license of bayes/sort.h and bayes/sort.c, please see the header
8  * of the files.
9  *
10  * ------------------------------------------------------------------------
11  *
12  * For the license of kmeans, please see kmeans/LICENSE.kmeans
13  *
14  * ------------------------------------------------------------------------
15  *
16  * For the license of ssca2, please see ssca2/COPYRIGHT
17  *
18  * ------------------------------------------------------------------------
19  *
20  * For the license of lib/mt19937ar.c and lib/mt19937ar.h, please see the
21  * header of the files.
22  *
23  * ------------------------------------------------------------------------
24  *
25  * For the license of lib/rbtree.h and lib/rbtree.c, please see
26  * lib/LEGALNOTICE.rbtree and lib/LICENSE.rbtree
27  *
28  * ------------------------------------------------------------------------
29  *
30  * Unless otherwise noted, the following license applies to STAMP files:
31  *
32  * Copyright (c) 2007, Stanford University
33  * All rights reserved.
34  *
35  * Redistribution and use in source and binary forms, with or without
36  * modification, are permitted provided that the following conditions are
37  * met:
38  *
39  * * Redistributions of source code must retain the above copyright
40  * notice, this list of conditions and the following disclaimer.
41  *
42  * * Redistributions in binary form must reproduce the above copyright
43  * notice, this list of conditions and the following disclaimer in
44  * the documentation and/or other materials provided with the
45  * distribution.
46  *
47  * * Neither the name of Stanford University nor the names of its
48  * contributors may be used to endorse or promote products derived
49  * from this software without specific prior written permission.
50  *
51  * THIS SOFTWARE IS PROVIDED BY STANFORD UNIVERSITY ``AS IS'' AND ANY
52  * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
53  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
54  * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL STANFORD UNIVERSITY BE LIABLE
55  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
56  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
57  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
58  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
59  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
60  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
61  * THE POSSIBILITY OF SUCH DAMAGE.
62  *
63  * =============================================================================
64  */
65 
66 
67 #ifndef FINDSUBGRAPHS_H
68 #define FINDSUBGRAPHS_H 1
69 
70 
71 #include "defs.h"
72 
73 typedef struct findSubGraphs0_arg {
82 
83 typedef struct findSubGraphs1_arg {
92 
93 typedef struct findSubGraphs2_arg {
102 
103 
104 /* =============================================================================
105  * findSubGraphs0
106  * =============================================================================
107  */
108 void
109 findSubGraphs0 (void* argPtr);
110 
111 
112 /* =============================================================================
113  * findSubGraphs1
114  * =============================================================================
115  */
116 void
117 findSubGraphs1 (void* argPtr);
118 
119 
120 /* =============================================================================
121  * findSubGraphs2
122  * =============================================================================
123  */
124 void
125 findSubGraphs2 (void* argPtr);
126 
127 
128 #endif /* FINDSUBGRAPHS_H */
129 
130 
131 /* =============================================================================
132  *
133  * End of findSubGraphs.h
134  *
135  * =============================================================================
136  */
struct findSubGraphs0_arg findSubGraphs0_arg_t
void findSubGraphs0(void *argPtr)
Definition: findSubGraphs.c:84
Definition: findSubGraphs.h:93
Vd * strWtVDList
Definition: findSubGraphs.h:96
struct findSubGraphs1_arg findSubGraphs1_arg_t
Definition: findSubGraphs.h:73
long maxIntWtListSize
Definition: findSubGraphs.h:98
Definition: defs.h:133
graph * GPtr
Definition: findSubGraphs.h:84
long soughtStrWtListSize
Definition: findSubGraphs.h:90
graph * GPtr
Definition: findSubGraphs.h:74
edge * maxIntWtList
Definition: findSubGraphs.h:77
V * intWtVList
Definition: findSubGraphs.h:75
struct findSubGraphs2_arg findSubGraphs2_arg_t
Definition: defs.h:127
void findSubGraphs1(void *argPtr)
Definition: findSubGraphs.c:243
Definition: edge.hpp:36
long soughtStrWtListSize
Definition: findSubGraphs.h:100
edge * soughtStrWtList
Definition: findSubGraphs.h:99
Vl ** strWtVLList
Definition: findSubGraphs.h:86
Definition: defs.h:95
long maxIntWtListSize
Definition: findSubGraphs.h:78
long soughtStrWtListSize
Definition: findSubGraphs.h:80
Definition: findSubGraphs.h:83
Vd * intWtVDList
Definition: findSubGraphs.h:95
void findSubGraphs2(void *argPtr)
Definition: findSubGraphs.c:394
Vl ** intWtVLList
Definition: findSubGraphs.h:85
edge * soughtStrWtList
Definition: findSubGraphs.h:89
long maxIntWtListSize
Definition: findSubGraphs.h:88
edge * soughtStrWtList
Definition: findSubGraphs.h:79
Definition: defs.h:140
edge * maxIntWtList
Definition: findSubGraphs.h:87
V * strWtVList
Definition: findSubGraphs.h:76
edge * maxIntWtList
Definition: findSubGraphs.h:97
graph * GPtr
Definition: findSubGraphs.h:94