GraphCommitChanges
Description
Apply all pending edge removals and node deletion marks.
Deleted slots remain reusable and future nodes may reuse their slot indices with fresh generations. Any deleted node id or GraphNode handle becomes invalid immediately after commit returns.
This deferred mutation model is meant for passes that need stable traversal first and destructive graph rewrites second.
Parameters
| Name | Direction | Description |
|---|---|---|
g |
in,out | Graph to commit. |
Success
Number of pending removals applied by this commit. Explicit edge removals and node deletion marks are counted once each. Incident edge cleanup caused by node deletion is not counted separately.
Failure
Does not return on invalid graph.
Usage example (Cross-references)
Usage examples (Cross-references)
- In
Graph.Ops.c:30:
static bool test_graph_mark_delete_commit_and_reuse(void) {
WriteFmt("Testing GraphMarkNodeForDeletion and GraphCommitChanges\n");
typedef Graph(int) IntGraph;- In
Graph.Ops.c:50:
bool result = GraphContainsNode(&graph, b) && (graph.pending_delete_count == 1);
u64 removed = GraphCommitChanges(&graph);
result = result && (removed == 1);- In
Graph.Ops.c:89:
result = result && !GraphNodeMarkedForDeletion(node);
result = result && !GraphUnmarkNodeForDeletion(node);
result = result && (GraphCommitChanges(&graph) == 0);
result = result && GraphContainsNode(&graph, a);
result = result && (GraphNodeCount(&graph) == 1);- In
Graph.Ops.c:126:
result = result && !GraphMarkEdgeForRemoval(&graph, c, b);
u64 committed = GraphCommitChanges(&graph);
result = result && (committed == 2);- In
Graph.Ops.c:161:
result = result && !GraphEdgeMarkedForRemoval(&graph, a, b);
result = result && !GraphUnmarkEdgeForRemoval(&graph, a, b);
result = result && (GraphCommitChanges(&graph) == 0);
result = result && GraphHasEdge(&graph, a, b);
result = result && (GraphEdgeCount(&graph) == 1);- In
Graph.Ops.c:189:
result = result && !GraphEdgeMarkedForRemoval(&graph, a, b);
result = result && GraphEdgeMarkedForRemoval(&graph, a, c);
result = result && (GraphCommitChanges(&graph) == 1);
result = result && GraphHasEdge(&graph, a, b);
result = result && !GraphHasEdge(&graph, a, c);- In
Graph.Ops.c:214:
result = result && (GraphPredecessorAt(&graph, a, 0) == a);
result = result && GraphMarkEdgeForRemoval(&graph, a, a);
result = result && (GraphCommitChanges(&graph) == 1);
result = result && (GraphEdgeCount(&graph) == 0);
result = result && (GraphOutDegree(&graph, a) == 0);- In
Graph.Ops.c:242:
result = result && GraphEdgeMarkedForRemoval(&graph, a, b);
result = result && GraphNodeMarkedForDeletion(GraphGetNode(&graph, b));
result = result && (GraphCommitChanges(&graph) == 2);
result = result && !GraphContainsNode(&graph, b);
result = result && (GraphNodeCount(&graph) == 3);- In
Graph.Ops.c:270:
bool result = GraphMarkNodeForDeletion(GraphGetNode(&graph, b));
result = result && (GraphCommitChanges(&graph) == 1);
result = result && !GraphContainsNode(&graph, b);- In
Graph.Ops.c:298:
(void)GraphMarkNodeForDeletion(node);
(void)GraphCommitChanges(&graph);
(void)GraphNodeVisit(node);
Last updated on