GraphDeinit
Description
Deinitialize graph and all owned node payloads and adjacency storage.
Parameters
| Name | Direction | Description |
|---|---|---|
g |
in,out | Graph to deinitialize. |
Usage example (Cross-references)
Usage examples (Cross-references)
MapDeinit(&index);
GraphDeinit(&graph);
return result;
}
MapDeinit(&counts);
GraphDeinit(&graph);
return result;
} result = result && (GraphInDegree(&graph, a) == 0);
GraphDeinit(&graph);
return result;
} }
GraphDeinit(&graph);
return false;
} }
GraphDeinit(&graph);
return false;
} }
GraphDeinit(&graph);
return false;
}- In
Graph.Ops.c:25:
result = result && !GraphNodeVisited(node) && (GraphNodeVisitCount(node) == 0);
GraphDeinit(&graph);
return result;
}- In
Graph.Ops.c:69:
result = result && !GraphNodeVisited(GraphGetNode(&graph, d));
GraphDeinit(&graph);
return result;
}- In
Graph.Ops.c:93:
result = result && (GraphNodeCount(&graph) == 1);
GraphDeinit(&graph);
return result;
}- In
Graph.Ops.c:139:
result = result && (GraphPredecessorAt(&graph, c, 0) == a);
GraphDeinit(&graph);
return result;
}- In
Graph.Ops.c:165:
result = result && (GraphEdgeCount(&graph) == 1);
GraphDeinit(&graph);
return result;
}- In
Graph.Ops.c:196:
result = result && (GraphInDegree(&graph, c) == 0);
GraphDeinit(&graph);
return result;
}- In
Graph.Ops.c:219:
result = result && (GraphInDegree(&graph, a) == 0);
GraphDeinit(&graph);
return result;
}- In
Graph.Ops.c:252:
result = result && (GraphInDegree(&graph, d) == 0);
GraphDeinit(&graph);
return result;
}- In
Graph.Ops.c:284:
result = result && (GraphNodeAt(&graph, reused) == 99);
GraphDeinit(&graph);
return result;
}- In
Graph.Ops.c:301:
(void)GraphNodeVisit(node);
GraphDeinit(&graph);
return false;
}- In
Graph.Init.c:57:
result = result && (VecPtrAt(&graph.slots, GraphNodeIdIndex(third_id))->generation == (third_generation + 1));
GraphDeinit(&graph);
return result;
}- In
Graph.Init.c:79:
StrDeinit(&name);
GraphDeinit(&graph);
return result;
}- In
Graph.Type.c:20:
graph.alignment == 1 && graph.type_anchor == NULL;
GraphDeinit(&graph);
return result;
}- In
Graph.Type.c:38:
result = result && GraphContainsNode(&graph, node_id);
GraphDeinit(&graph);
return result;
} result = result && GraphPredecessorAt(&graph, c, 0) == a;
GraphDeinit(&graph);
return result;
} result = result && (ZstrCompare(*GraphNodePtrAt(&graph, red), "red") == 0);
GraphDeinit(&graph);
return result;
} (void)GraphNodeData(&graph_b, node);
GraphDeinit(&graph_b);
GraphDeinit(&graph_a);
return false;
GraphDeinit(&graph_b);
GraphDeinit(&graph_a);
return false;
} (void)GraphPredecessorAt(&graph, a, 0);
GraphDeinit(&graph);
return false;
} (void)GraphNeighborAt(&graph, b, 0);
GraphDeinit(&graph);
return false;
} result = result && GraphNodeAt(&graph, id1) == 7;
GraphDeinit(&graph);
return result;
} result = result && GraphPredecessorAt(&graph, c, 0) == a;
GraphDeinit(&graph);
return result;
} result = result && (GraphPredecessorAt(&graph, a, 2) == c);
GraphDeinit(&graph);
return result;
}
Last updated on