Function contains_node

tests/unit/test_query_graph.c:63–69

}

bool contains_node(const QueryGraph *qg, const QGNode *n) {
	uint count = QueryGraph_NodeCount(qg);
	for(uint i = 0; i < count; i ++) {
		if(qg->nodes[i] == n) return true;
	}
	return false;
}

bool contains_edge(const QueryGraph *qg, const QGEdge *e) {
	uint count = QueryGraph_EdgeCount(qg);