GraphDeinit

Documentation

API Reference

GraphDeinit

Description

Release every node, every edge list, and the backing slot storage of g. If the graph was created with a deep-copy deinit callback, that callback is invoked on each live node payload before the slot is freed.

Parameters

Name	Direction	Description
`g`	in,out	Graph to deinitialize. Must not be used until reinitialized.

Success

All node payloads released, all edge bookkeeping freed; g left in the zeroed post-deinit state.

Failure

Cannot fail; aborts on a corrupted magic via the validator.

Usage example (Cross-references)

Usage examples (Cross-references)

In Graph.Access.c:45:

        result = result && GraphPredecessorAt(&graph, c, 0) == a;
    
        GraphDeinit(&graph);
        DefaultAllocatorDeinit(&alloc);
        return result;

In Graph.Access.c:71:

        result      = result && (ZstrCompare(*GraphNodePtrAt(&graph, red), "red") == 0);
    
        GraphDeinit(&graph);
        DefaultAllocatorDeinit(&alloc);
        return result;

In Graph.Access.c:88:

        (void)GraphNodeData(&graph_b, node);
    
        GraphDeinit(&graph_b);
        GraphDeinit(&graph_a);
        DefaultAllocatorDeinit(&alloc);

In Graph.Access.c:89:

    
        GraphDeinit(&graph_b);
        GraphDeinit(&graph_a);
        DefaultAllocatorDeinit(&alloc);
        return false;

In Graph.Access.c:108:

        (void)GraphPredecessorAt(&graph, a, 0);
    
        GraphDeinit(&graph);
        DefaultAllocatorDeinit(&alloc);
        return false;

In Graph.Access.c:127:

        (void)GraphNeighborAt(&graph, b, 0);
    
        GraphDeinit(&graph);
        DefaultAllocatorDeinit(&alloc);
        return false;

In Graph.Type.c:29:

                      GraphMutationEpoch(&graph) == 0 && GraphAllocator(&graph)->alignment == 1;
    
        GraphDeinit(&graph);
        DefaultAllocatorDeinit(&alloc);
        return result;

In Graph.Type.c:51:

        result = result && GraphContainsNode(&graph, node_id);
    
        GraphDeinit(&graph);
        HeapAllocatorDeinit(&alloc);
        return result;

In Graph.Ops.c:28:

        result = result && !GraphNodeVisited(node) && (GraphNodeVisitCount(node) == 0);
    
        GraphDeinit(&graph);
        DefaultAllocatorDeinit(&alloc);
        return result;

In Graph.Ops.c:75:

        result = result && !GraphNodeVisited(GraphGetNode(&graph, d));
    
        GraphDeinit(&graph);
        DefaultAllocatorDeinit(&alloc);
        return result;

In Graph.Ops.c:102:

        result      = result && (GraphNodeCount(&graph) == 1);
    
        GraphDeinit(&graph);
        DefaultAllocatorDeinit(&alloc);
        return result;

In Graph.Ops.c:151:

        result = result && (GraphPredecessorAt(&graph, c, 0) == a);
    
        GraphDeinit(&graph);
        DefaultAllocatorDeinit(&alloc);
        return result;

In Graph.Ops.c:180:

        result      = result && (GraphEdgeCount(&graph) == 1);
    
        GraphDeinit(&graph);
        DefaultAllocatorDeinit(&alloc);
        return result;

In Graph.Ops.c:214:

        result      = result && (GraphInDegree(&graph, c) == 0);
    
        GraphDeinit(&graph);
        DefaultAllocatorDeinit(&alloc);
        return result;

In Graph.Ops.c:240:

        result      = result && (GraphInDegree(&graph, a) == 0);
    
        GraphDeinit(&graph);
        DefaultAllocatorDeinit(&alloc);
        return result;

In Graph.Ops.c:276:

        result      = result && (GraphInDegree(&graph, d) == 0);
    
        GraphDeinit(&graph);
        DefaultAllocatorDeinit(&alloc);
        return result;

In Graph.Ops.c:311:

        result                           = result && (GraphNodeAt(&graph, reused) == 99);
    
        GraphDeinit(&graph);
        DefaultAllocatorDeinit(&alloc);
        return result;

In Graph.Ops.c:331:

        (void)GraphNodeVisit(node);
    
        GraphDeinit(&graph);
        DefaultAllocatorDeinit(&alloc);
        return false;

In Graph.Init.c:68:

        result = result && (VecPtrAt(&graph.slots, GraphNodeIdIndex(third_id))->generation == (third_generation + 1));
    
        GraphDeinit(&graph);
        DefaultAllocatorDeinit(&alloc);
        return result;

In Graph.Init.c:93:

    
        StrDeinit(&name);
        GraphDeinit(&graph);
        DefaultAllocatorDeinit(&alloc);
        return result;

In Graph.Init.c:116:

                      ZstrCompare(StrBegin(stored_name), "alpha") == 0;
    
        GraphDeinit(&graph);
        DefaultAllocatorDeinit(&alloc);
        return result;

In Graph.Init.c:167:

        result = result && (graph_h.pending_edge_removals.allocator->retry_limit == 31);
    
        GraphDeinit(&graph_a);
        GraphDeinit(&graph_b);
        GraphDeinit(&graph_c);

In Graph.Init.c:168:

    
        GraphDeinit(&graph_a);
        GraphDeinit(&graph_b);
        GraphDeinit(&graph_c);
        GraphDeinit(&graph_d);

In Graph.Init.c:169:

        GraphDeinit(&graph_a);
        GraphDeinit(&graph_b);
        GraphDeinit(&graph_c);
        GraphDeinit(&graph_d);
        GraphDeinit(&graph_e);

In Graph.Init.c:170:

        GraphDeinit(&graph_b);
        GraphDeinit(&graph_c);
        GraphDeinit(&graph_d);
        GraphDeinit(&graph_e);
        GraphDeinit(&graph_f);

In Graph.Init.c:171:

        GraphDeinit(&graph_c);
        GraphDeinit(&graph_d);
        GraphDeinit(&graph_e);
        GraphDeinit(&graph_f);
        GraphDeinit(&graph_g);

In Graph.Init.c:172:

        GraphDeinit(&graph_d);
        GraphDeinit(&graph_e);
        GraphDeinit(&graph_f);
        GraphDeinit(&graph_g);
        GraphDeinit(&graph_h);

In Graph.Init.c:173:

        GraphDeinit(&graph_e);
        GraphDeinit(&graph_f);
        GraphDeinit(&graph_g);
        GraphDeinit(&graph_h);

In Graph.Init.c:174:

        GraphDeinit(&graph_f);
        GraphDeinit(&graph_g);
        GraphDeinit(&graph_h);
    
        HeapAllocatorDeinit(&aligned_64);

In Graph.Insert.c:25:

        result      = result && GraphNodeAt(&graph, id1) == 7;
    
        GraphDeinit(&graph);
        DefaultAllocatorDeinit(&alloc);
        return result;

In Graph.Insert.c:55:

        result      = result && GraphPredecessorAt(&graph, c, 0) == a;
    
        GraphDeinit(&graph);
        DefaultAllocatorDeinit(&alloc);
        return result;

In Graph.Insert.c:84:

        result      = result && (GraphPredecessorAt(&graph, a, 2) == c);
    
        GraphDeinit(&graph);
        DefaultAllocatorDeinit(&alloc);
        return result;

In Graph.Foreach.c:125:

    
        MapDeinit(&index);
        GraphDeinit(&graph);
        DefaultAllocatorDeinit(&alloc);
        return result;

In Graph.Foreach.c:165:

    
        MapDeinit(&counts);
        GraphDeinit(&graph);
        DefaultAllocatorDeinit(&alloc);
        return result;

In Graph.Foreach.c:201:

        result      = result && (GraphInDegree(&graph, a) == 0);
    
        GraphDeinit(&graph);
        DefaultAllocatorDeinit(&alloc);
        return result;

In Graph.Foreach.c:222:

        }
    
        GraphDeinit(&graph);
        DefaultAllocatorDeinit(&alloc);
        return false;

In Graph.Foreach.c:246:

        }
    
        GraphDeinit(&graph);
        DefaultAllocatorDeinit(&alloc);
        return false;

In Graph.Foreach.c:272:

        }
    
        GraphDeinit(&graph);
        DefaultAllocatorDeinit(&alloc);
        return false;

Last updated on June 10, 2026

GraphCopyInit GraphEdgeCount