Function contains_edge

tests/unit/test_query_graph.c:71–77

}

bool contains_edge(const QueryGraph *qg, const QGEdge *e) {
	uint count = QueryGraph_EdgeCount(qg);
	for(uint i = 0; i < count; i ++) {
		if(qg->edges[i] == e) return true;
	}
	return false;
}

QueryGraph *SingleNodeGraph() {
	// create a single node graph