GraphInit

Documentation

API Reference

GraphInit

Description

Initialize an empty shallow-copy Graph. Inside a Scope block the allocator argument may be omitted; otherwise pass a typed allocator handle.

Success

Returns a live, empty graph with NULL copy callbacks (bitwise-copy semantics).

Failure

Cannot fail at construction; first allocation failures surface from later inserts.

Usage example (Cross-references)

Usage examples (Cross-references)

In Graph.Access.c:14:

    
        typedef Graph(int) IntGraph;
        IntGraph graph = GraphInit(&alloc);
    
        GraphNodeId a = GraphAddNodeR(&graph, 10);

In Graph.Access.c:56:

    
        typedef Graph(Zstr) ZstrGraph;
        ZstrGraph graph = GraphInit(&alloc);
    
        GraphNodeId red   = GraphAddNodeR(&graph, "red");

In Graph.Access.c:82:

    
        typedef Graph(int) IntGraph;
        IntGraph  graph_a = GraphInit(&alloc);
        IntGraph  graph_b = GraphInit(&alloc);
        GraphNode node    = GraphGetNode(&graph_a, GraphAddNodeR(&graph_a, 10));

In Graph.Access.c:83:

        typedef Graph(int) IntGraph;
        IntGraph  graph_a = GraphInit(&alloc);
        IntGraph  graph_b = GraphInit(&alloc);
        GraphNode node    = GraphGetNode(&graph_a, GraphAddNodeR(&graph_a, 10));

In Graph.Access.c:100:

    
        typedef Graph(int) IntGraph;
        IntGraph graph = GraphInit(&alloc);
    
        GraphNodeId a = GraphAddNodeR(&graph, 10);

In Graph.Access.c:119:

    
        typedef Graph(int) IntGraph;
        IntGraph graph = GraphInit(&alloc);
    
        GraphNodeId a = GraphAddNodeR(&graph, 10);

In Graph.Type.c:14:

    
        typedef Graph(int) IntGraph;
        IntGraph graph = GraphInit(&alloc);
    
        ValidateGraph(&graph);

In Graph.Type.c:40:

    
        typedef Graph(int) IntGraph;
        IntGraph graph = GraphInit(&alloc);
    
        GraphNodeId node_id = GraphAddNodeR(&graph, 11);

In Graph.Ops.c:13:

    
        typedef Graph(int) IntGraph;
        IntGraph graph = GraphInit(&alloc);
    
        GraphNodeId a    = GraphAddNodeR(&graph, 10);

In Graph.Ops.c:39:

    
        typedef Graph(int) IntGraph;
        IntGraph graph = GraphInit(&alloc);
    
        GraphNodeId a = GraphAddNodeR(&graph, 10);

In Graph.Ops.c:86:

    
        typedef Graph(int) IntGraph;
        IntGraph graph = GraphInit(&alloc);
    
        GraphNodeId a    = GraphAddNodeR(&graph, 10);

In Graph.Ops.c:113:

    
        typedef Graph(int) IntGraph;
        IntGraph graph = GraphInit(&alloc);
    
        GraphNodeId a = GraphAddNodeR(&graph, 10);

In Graph.Ops.c:162:

    
        typedef Graph(int) IntGraph;
        IntGraph graph = GraphInit(&alloc);
    
        GraphNodeId a = GraphAddNodeR(&graph, 10);

In Graph.Ops.c:191:

    
        typedef Graph(int) IntGraph;
        IntGraph graph = GraphInit(&alloc);
    
        GraphNodeId a = GraphAddNodeR(&graph, 10);

In Graph.Ops.c:225:

    
        typedef Graph(int) IntGraph;
        IntGraph graph = GraphInit(&alloc);
    
        GraphNodeId a = GraphAddNodeR(&graph, 10);

In Graph.Ops.c:251:

    
        typedef Graph(int) IntGraph;
        IntGraph graph = GraphInit(&alloc);
    
        GraphNodeId a = GraphAddNodeR(&graph, 10);

In Graph.Ops.c:287:

    
        typedef Graph(int) IntGraph;
        IntGraph graph = GraphInit(&alloc);
    
        GraphNodeId a         = GraphAddNodeR(&graph, 10);

In Graph.Ops.c:322:

    
        typedef Graph(int) IntGraph;
        IntGraph graph = GraphInit(&alloc);
    
        GraphNodeId a    = GraphAddNodeR(&graph, 10);

In Graph.Init.c:16:

    
        typedef Graph(int) IntGraph;
        IntGraph graph = GraphInit(&alloc);
    
        GraphReserve(&graph, 8);

In Graph.Init.c:141:

        aligned_64.base.retry_limit = 31;
    
        StrGraph graph_a = GraphInit(&alloc);
        StrGraph graph_b = GraphInitT(graph_b, &alloc);
        StrGraph graph_c = GraphInitWithDeepCopy(str_init_copy, str_deinit, &alloc);

In Graph.Init.c:145:

        StrGraph graph_c = GraphInitWithDeepCopy(str_init_copy, str_deinit, &alloc);
        StrGraph graph_d = GraphInitWithDeepCopyT(graph_d, str_init_copy, str_deinit, &alloc);
        StrGraph graph_e = GraphInit(&aligned_8);
        StrGraph graph_f = GraphInitT(graph_f, &aligned_16);
        StrGraph graph_g = GraphInitWithDeepCopy(str_init_copy, str_deinit, &aligned_32);

In Graph.Insert.c:13:

    
        typedef Graph(int) IntGraph;
        IntGraph graph  = GraphInit(&alloc);
        int      owned  = 42;
        int      shared = 7;

In Graph.Insert.c:36:

    
        typedef Graph(int) IntGraph;
        IntGraph graph = GraphInit(&alloc);
    
        GraphNodeId a = GraphAddNodeR(&graph, 1);

In Graph.Insert.c:66:

    
        typedef Graph(int) IntGraph;
        IntGraph graph = GraphInit(&alloc);
    
        GraphNodeId a = GraphAddNodeR(&graph, 1);

In Graph.Foreach.c:138:

        typedef Map(GraphNodeId, u64) CountMap;
    
        IntGraph graph  = GraphInit(&alloc);
        CountMap counts = MapInit(node_id_hash, node_id_compare, &alloc);

In Graph.Foreach.c:176:

    
        typedef Graph(int) IntGraph;
        IntGraph graph = GraphInit(&alloc);
    
        GraphNodeId a = GraphAddNodeR(&graph, 1);

In Graph.Foreach.c:212:

    
        typedef Graph(int) IntGraph;
        IntGraph graph = GraphInit(&alloc);
    
        GraphAddNodeR(&graph, 1);

In Graph.Foreach.c:233:

    
        typedef Graph(int) IntGraph;
        IntGraph graph = GraphInit(&alloc);
    
        GraphNodeId a = GraphAddNodeR(&graph, 1);

In Graph.Foreach.c:257:

    
        typedef Graph(int) IntGraph;
        IntGraph graph = GraphInit(&alloc);
    
        GraphNodeId a = GraphAddNodeR(&graph, 1);

Last updated on June 10, 2026

GraphInDegree GraphInitT