bidirected-adjacency-array 1.1.2

Represent a bidirected graph via an adjacency array.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30

use std::io::Read;

use tagged_vec::TaggedVec;

use crate::{graph::BidirectedAdjacencyArray, index::GraphIndexInteger};

impl<IndexType: GraphIndexInteger, NodeData: Copy, EdgeData: Copy>
    BidirectedAdjacencyArray<IndexType, NodeData, EdgeData>
{
    /// Reads a bidirected adjacency array from a platform-dependent binary format.
    pub fn read_binary(mut reader: impl Read) -> std::io::Result<Self> {
        Ok(Self {
            node_array: TaggedVec::read_binary(&mut reader)?,
            edge_array: TaggedVec::read_binary(&mut reader)?,
            node_data: TaggedVec::read_binary(&mut reader)?,
            edge_data_keys: TaggedVec::read_binary(&mut reader)?,
            edge_data: TaggedVec::read_binary(&mut reader)?,
        })
    }

    /// Writes the bidirected adjacency array into a platform-dependent binary format.
    pub fn write_binary(&self, mut writer: impl std::io::Write) -> std::io::Result<()> {
        self.node_array.write_binary(&mut writer)?;
        self.edge_array.write_binary(&mut writer)?;
        self.node_data.write_binary(&mut writer)?;
        self.edge_data_keys.write_binary(&mut writer)?;
        self.edge_data.write_binary(&mut writer)?;
        Ok(())
    }
}