MCPcopy Create free account
hub / github.com/RedisGraph/RedisGraph / QueryGraph_Free

Function QueryGraph_Free

src/graph/query_graph.c:801–822  ·  view source on GitHub ↗

frees entire graph

Source from the content-addressed store, hash-verified

799
800// frees entire graph
801void QueryGraph_Free
802(
803 QueryGraph *qg
804) {
805 if(qg == NULL) return;
806
807 // free QueryGraph nodes
808 uint nodeCount = QueryGraph_NodeCount(qg);
809 for(uint i = 0; i < nodeCount; i++) {
810 QGNode_Free(qg->nodes[i]);
811 }
812
813 // free QueryGraph edges
814 uint edgeCount = QueryGraph_EdgeCount(qg);
815 for(uint i = 0; i < edgeCount; i++) {
816 QGEdge_Free(qg->edges[i]);
817 }
818
819 array_free(qg->nodes);
820 array_free(qg->edges);
821 rm_free(qg);
822}
823

Callers 15

AST_PreparePathCreationFunction · 0.85
buildMatchOpTreeFunction · 0.85
tearDownFunction · 0.85
test_BFSLevelsFunction · 0.85
test_QueryGraphCloneFunction · 0.85

Calls 6

QueryGraph_NodeCountFunction · 0.85
QGNode_FreeFunction · 0.85
QueryGraph_EdgeCountFunction · 0.85
QGEdge_FreeFunction · 0.85
array_freeFunction · 0.85
rm_freeFunction · 0.85

Tested by 10

tearDownFunction · 0.68
test_BFSLevelsFunction · 0.68
test_QueryGraphCloneFunction · 0.68
test_acyclicGraphFunction · 0.68
test_cyclicGraphFunction · 0.68
test_DFSLevelsFunction · 0.68