{"ast_node_type":"variable","tokens":[{"end":32,"kind":"keyword","start":0,"text":"let"}]}
        let mut edge_list_data =
        // length is about the same fractional overhead and it amortizes for yet greater lengths.
            Vec::with_capacity(graph_bytes - node_count * size_of::<SerializedNodeHeader<D>>());