frees entire graph
| 799 | |
| 800 | // frees entire graph |
| 801 | void 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 |