| 77 | } |
| 78 | |
| 79 | QueryGraph *SingleNodeGraph() { |
| 80 | // create a single node graph |
| 81 | // (A) |
| 82 | size_t node_cap = 1; |
| 83 | size_t edge_cap = 0; |
| 84 | |
| 85 | // create nodes |
| 86 | QGNode *A = QGNode_New("A"); |
| 87 | QueryGraph *g = QueryGraph_New(node_cap, edge_cap); |
| 88 | QueryGraph_AddNode(g, A); |
| 89 | |
| 90 | return g; |
| 91 | } |
| 92 | |
| 93 | QueryGraph *TriangleGraph() { |
| 94 | // create a triangle graph |
no test coverage detected