| 241 | } |
| 242 | |
| 243 | QueryGraph *QueryGraph_New |
| 244 | ( |
| 245 | uint node_cap, |
| 246 | uint edge_cap |
| 247 | ) { |
| 248 | QueryGraph *qg = rm_malloc(sizeof(QueryGraph)); |
| 249 | |
| 250 | qg->nodes = array_new(QGNode *, node_cap); |
| 251 | qg->edges = array_new(QGEdge *, edge_cap); |
| 252 | qg->unknown_reltype_ids = false; |
| 253 | |
| 254 | return qg; |
| 255 | } |
| 256 | |
| 257 | void QueryGraph_AddNode |
| 258 | ( |