graphrecords_core/graphrecord/

mod.rs

pub mod attributes;
#[cfg(feature = "connectors")]
pub mod connector;
pub mod datatypes;
mod graph;
mod group_mapping;
#[cfg(feature = "plugins")]
pub mod plugins;
mod polars;
pub mod schema;

pub use self::{
    datatypes::{GraphRecordAttribute, GraphRecordValue},
    graph::{AttributeMap, EdgeIndex, NodeIndex},
    group_mapping::Group,
};
#[cfg(feature = "serde")]
use crate::errors::ConversionError;
#[cfg(feature = "plugins")]
use crate::graphrecord::plugins::{Plugin, PluginName};
use crate::{
    errors::{GraphRecordError, GraphRecordResult, SchemaError},
    graphrecord::{
        attributes::{EdgeAttributesMut, NodeAttributesMut},
        polars::DataFramesExport,
    },
};
use ::polars::frame::DataFrame;
use graph::Graph;
#[cfg(feature = "plugins")]
use graphrecords_utils::aliases::GrHashMap;
use graphrecords_utils::aliases::GrHashSet;
use group_mapping::GroupMapping;
use polars::{dataframe_to_edges, dataframe_to_nodes};
use schema::{GroupSchema, Schema, SchemaType};
#[cfg(feature = "serde")]
use serde::{Deserialize, Serialize};
#[cfg(feature = "plugins")]
use std::sync::Arc;
use std::{
    collections::{HashMap, hash_map::Entry},
    mem,
};
#[cfg(feature = "serde")]
use std::{fs, path::Path};

#[derive(Debug, Clone)]
pub struct NodeDataFrameInput {
    pub dataframe: DataFrame,
    pub index_column: String,
}

#[derive(Debug, Clone)]
pub struct EdgeDataFrameInput {
    pub dataframe: DataFrame,
    pub source_index_column: String,
    pub target_index_column: String,
}

impl<D, S> From<(D, S)> for NodeDataFrameInput
where
    D: Into<DataFrame>,
    S: Into<String>,
{
    fn from(val: (D, S)) -> Self {
        Self {
            dataframe: val.0.into(),
            index_column: val.1.into(),
        }
    }
}

impl<D, S> From<(D, S, S)> for EdgeDataFrameInput
where
    D: Into<DataFrame>,
    S: Into<String>,
{
    fn from(val: (D, S, S)) -> Self {
        Self {
            dataframe: val.0.into(),
            source_index_column: val.1.into(),
            target_index_column: val.2.into(),
        }
    }
}

fn node_dataframes_to_tuples(
    nodes_dataframes: impl IntoIterator<Item = impl Into<NodeDataFrameInput>>,
) -> GraphRecordResult<Vec<(NodeIndex, AttributeMap)>> {
    let nodes = nodes_dataframes
        .into_iter()
        .map(|dataframe_input| {
            let dataframe_input = dataframe_input.into();

            dataframe_to_nodes(dataframe_input.dataframe, &dataframe_input.index_column)
        })
        .collect::<GraphRecordResult<Vec<_>>>()?
        .into_iter()
        .flatten()
        .collect();

    Ok(nodes)
}

fn edge_dataframes_to_tuples(
    edges_dataframes: impl IntoIterator<Item = impl Into<EdgeDataFrameInput>>,
) -> GraphRecordResult<Vec<(NodeIndex, NodeIndex, AttributeMap)>> {
    let edges = edges_dataframes
        .into_iter()
        .map(|dataframe_input| {
            let dataframe_input = dataframe_input.into();

            dataframe_to_edges(
                dataframe_input.dataframe,
                &dataframe_input.source_index_column,
                &dataframe_input.target_index_column,
            )
        })
        .collect::<GraphRecordResult<Vec<_>>>()?
        .into_iter()
        .flatten()
        .collect();

    Ok(edges)
}

#[allow(clippy::type_complexity)]
fn dataframes_to_tuples(
    nodes_dataframes: impl IntoIterator<Item = impl Into<NodeDataFrameInput>>,
    edges_dataframes: impl IntoIterator<Item = impl Into<EdgeDataFrameInput>>,
) -> GraphRecordResult<(
    Vec<(NodeIndex, AttributeMap)>,
    Vec<(NodeIndex, NodeIndex, AttributeMap)>,
)> {
    let nodes = node_dataframes_to_tuples(nodes_dataframes)?;
    let edges = edge_dataframes_to_tuples(edges_dataframes)?;

    Ok((nodes, edges))
}

#[derive(Default, Debug, Clone)]
#[allow(clippy::unsafe_derive_deserialize)]
#[cfg_attr(feature = "serde", derive(Serialize, Deserialize))]
pub struct GraphRecord {
    graph: Graph,
    group_mapping: GroupMapping,
    schema: Schema,

    #[cfg(feature = "plugins")]
    plugins: Arc<GrHashMap<PluginName, Box<dyn Plugin>>>,
}

impl GraphRecord {
    #[must_use]
    pub fn new() -> Self {
        Self::default()
    }

    #[must_use]
    pub fn with_schema(schema: Schema) -> Self {
        Self {
            schema,
            ..Default::default()
        }
    }

    #[must_use]
    pub fn with_capacity(nodes: usize, edges: usize, schema: Option<Schema>) -> Self {
        Self {
            graph: Graph::with_capacity(nodes, edges),
            schema: schema.unwrap_or_default(),
            ..Default::default()
        }
    }

    pub fn from_tuples(
        nodes: Vec<(NodeIndex, AttributeMap)>,
        edges: Option<Vec<(NodeIndex, NodeIndex, AttributeMap)>>,
        schema: Option<Schema>,
    ) -> GraphRecordResult<Self> {
        let mut graphrecord = Self::with_capacity(
            nodes.len(),
            edges.as_ref().map_or(0, std::vec::Vec::len),
            schema,
        );

        for (node_index, attributes) in nodes {
            graphrecord.add_node_impl(node_index, attributes)?;
        }

        if let Some(edges) = edges {
            for (source_node_index, target_node_index, attributes) in edges {
                graphrecord.add_edge_impl(source_node_index, target_node_index, attributes)?;
            }
        }

        Ok(graphrecord)
    }

    pub fn from_dataframes(
        nodes_dataframes: impl IntoIterator<Item = impl Into<NodeDataFrameInput>>,
        edges_dataframes: impl IntoIterator<Item = impl Into<EdgeDataFrameInput>>,
        schema: Option<Schema>,
    ) -> GraphRecordResult<Self> {
        let (nodes, edges) = dataframes_to_tuples(nodes_dataframes, edges_dataframes)?;

        Self::from_tuples(nodes, Some(edges), schema)
    }

    pub fn from_nodes_dataframes(
        nodes_dataframes: impl IntoIterator<Item = impl Into<NodeDataFrameInput>>,
        schema: Option<Schema>,
    ) -> GraphRecordResult<Self> {
        let nodes = node_dataframes_to_tuples(nodes_dataframes)?;

        Self::from_tuples(nodes, None, schema)
    }

    #[cfg(feature = "serde")]
    pub fn from_ron<P>(path: P) -> GraphRecordResult<Self>
    where
        P: AsRef<Path>,
    {
        let file = fs::read_to_string(&path).map_err(|error| {
            GraphRecordError::Conversion(ConversionError::FileRead {
                path: path.as_ref().display().to_string(),
                kind: error.kind(),
            })
        })?;

        ron::from_str(&file).map_err(|_| {
            GraphRecordError::Conversion(ConversionError::RonDeserialization {
                path: path.as_ref().display().to_string(),
            })
        })
    }

    #[cfg(feature = "serde")]
    pub fn to_ron<P>(&self, path: P) -> GraphRecordResult<()>
    where
        P: AsRef<Path>,
    {
        let ron_string = ron::to_string(self)
            .map_err(|_| GraphRecordError::Conversion(ConversionError::RonSerialization))?;

        if let Some(parent) = path.as_ref().parent() {
            fs::create_dir_all(parent).map_err(|error| {
                GraphRecordError::Conversion(ConversionError::DirectoryCreation {
                    path: parent.display().to_string(),
                    kind: error.kind(),
                })
            })?;
        }

        fs::write(&path, ron_string).map_err(|error| {
            GraphRecordError::Conversion(ConversionError::FileWrite {
                path: path.as_ref().display().to_string(),
                kind: error.kind(),
            })
        })
    }

    pub fn to_dataframes(&self) -> GraphRecordResult<DataFramesExport> {
        DataFramesExport::new(self)
    }

    #[allow(clippy::too_many_lines)]
    fn set_schema_impl(&mut self, mut schema: Schema) -> GraphRecordResult<()> {
        let mut nodes_group_cache = HashMap::<&Group, usize>::new();
        let mut nodes_ungrouped_visited = false;
        let mut edges_group_cache = HashMap::<&Group, usize>::new();
        let mut edges_ungrouped_visited = false;

        for (node_index, node) in &self.graph.nodes {
            let groups_of_node: Vec<_> = self
                .groups_of_node(node_index)
                .expect("groups of node must exist")
                .collect();

            if groups_of_node.is_empty() {
                match schema.schema_type() {
                    SchemaType::Inferred => {
                        let nodes_in_groups = self.group_mapping.nodes_in_group.len();

                        let nodes_not_in_groups = self.graph.node_count() - nodes_in_groups;

                        schema.update_node(
                            &node.attributes,
                            None,
                            nodes_not_in_groups == 0 || !nodes_ungrouped_visited,
                        );

                        nodes_ungrouped_visited = true;
                    }
                    SchemaType::Provided => {
                        schema.validate_node(node_index, &node.attributes, None)?;
                    }
                }
            } else {
                for group in groups_of_node {
                    match schema.schema_type() {
                        SchemaType::Inferred => match nodes_group_cache.entry(group) {
                            Entry::Occupied(entry) => {
                                schema.update_node(
                                    &node.attributes,
                                    Some(group),
                                    *entry.get() == 0,
                                );
                            }
                            Entry::Vacant(entry) => {
                                entry.insert(
                                    self.group_mapping
                                        .nodes_in_group
                                        .get(group)
                                        .map_or(0, GrHashSet::len),
                                );

                                schema.update_node(&node.attributes, Some(group), true);
                            }
                        },
                        SchemaType::Provided => {
                            schema.validate_node(node_index, &node.attributes, Some(group))?;
                        }
                    }
                }
            }
        }

        for (edge_index, edge) in &self.graph.edges {
            let groups_of_edge: Vec<_> = self
                .groups_of_edge(edge_index)
                .expect("groups of edge must exist")
                .collect();

            if groups_of_edge.is_empty() {
                match schema.schema_type() {
                    SchemaType::Inferred => {
                        let edges_in_groups = self.group_mapping.edges_in_group.len();

                        let edges_not_in_groups = self.graph.edge_count() - edges_in_groups;

                        schema.update_edge(
                            &edge.attributes,
                            None,
                            edges_not_in_groups == 0 || !edges_ungrouped_visited,
                        );

                        edges_ungrouped_visited = true;
                    }
                    SchemaType::Provided => {
                        schema.validate_edge(edge_index, &edge.attributes, None)?;
                    }
                }
            } else {
                for group in groups_of_edge {
                    match schema.schema_type() {
                        SchemaType::Inferred => match edges_group_cache.entry(group) {
                            Entry::Occupied(entry) => {
                                schema.update_edge(
                                    &edge.attributes,
                                    Some(group),
                                    *entry.get() == 0,
                                );
                            }
                            Entry::Vacant(entry) => {
                                entry.insert(
                                    self.group_mapping
                                        .edges_in_group
                                        .get(group)
                                        .map_or(0, GrHashSet::len),
                                );

                                schema.update_edge(&edge.attributes, Some(group), true);
                            }
                        },
                        SchemaType::Provided => {
                            schema.validate_edge(edge_index, &edge.attributes, Some(group))?;
                        }
                    }
                }
            }
        }

        mem::swap(&mut self.schema, &mut schema);

        Ok(())
    }

    /// # Safety
    ///
    /// This function should only be used if the data has been validated against the schema.
    /// Using this function with invalid data may lead to undefined behavior.
    /// This function does not run any plugin hooks.
    pub const unsafe fn set_schema_unchecked(&mut self, schema: &mut Schema) {
        mem::swap(&mut self.schema, schema);
    }

    #[must_use]
    pub const fn get_schema(&self) -> &Schema {
        &self.schema
    }

    const fn freeze_schema_impl(&mut self) {
        self.schema.freeze();
    }

    const fn unfreeze_schema_impl(&mut self) {
        self.schema.unfreeze();
    }

    pub fn node_indices(&self) -> impl Iterator<Item = &NodeIndex> {
        self.graph.node_indices()
    }

    pub fn resolve_node_index(&self, node_index: &NodeIndex) -> GraphRecordResult<&NodeIndex> {
        self.graph.resolve_node_index(node_index)
    }

    pub fn node_attributes(&self, node_index: &NodeIndex) -> GraphRecordResult<&AttributeMap> {
        self.graph.node_attributes(node_index)
    }

    pub fn node_attributes_mut<'a>(
        &'a mut self,
        node_index: &'a NodeIndex,
    ) -> GraphRecordResult<NodeAttributesMut<'a>> {
        NodeAttributesMut::new(node_index, self)
    }

    pub fn outgoing_edges(
        &self,
        node_index: &NodeIndex,
    ) -> GraphRecordResult<impl Iterator<Item = &EdgeIndex> + use<'_>> {
        self.graph.outgoing_edges(node_index)
    }

    pub fn incoming_edges(
        &self,
        node_index: &NodeIndex,
    ) -> GraphRecordResult<impl Iterator<Item = &EdgeIndex> + use<'_>> {
        self.graph.incoming_edges(node_index)
    }

    pub fn edge_indices(&self) -> impl Iterator<Item = &EdgeIndex> {
        self.graph.edge_indices()
    }

    pub fn resolve_edge_index(&self, edge_index: &EdgeIndex) -> GraphRecordResult<&EdgeIndex> {
        self.graph.resolve_edge_index(edge_index)
    }

    pub fn edge_attributes(&self, edge_index: &EdgeIndex) -> GraphRecordResult<&AttributeMap> {
        self.graph.edge_attributes(edge_index)
    }

    pub fn edge_attributes_mut<'a>(
        &'a mut self,
        edge_index: &'a EdgeIndex,
    ) -> GraphRecordResult<EdgeAttributesMut<'a>> {
        EdgeAttributesMut::new(edge_index, self)
    }

    pub fn edge_endpoints(
        &self,
        edge_index: &EdgeIndex,
    ) -> GraphRecordResult<(&NodeIndex, &NodeIndex)> {
        self.graph.edge_endpoints(edge_index)
    }

    pub fn edges_connecting<'a>(
        &'a self,
        outgoing_node_indices: Vec<&'a NodeIndex>,
        incoming_node_indices: Vec<&'a NodeIndex>,
    ) -> impl Iterator<Item = &'a EdgeIndex> + 'a {
        self.graph
            .edges_connecting(outgoing_node_indices, incoming_node_indices)
    }

    pub fn edges_connecting_undirected<'a>(
        &'a self,
        first_node_indices: Vec<&'a NodeIndex>,
        second_node_indices: Vec<&'a NodeIndex>,
    ) -> impl Iterator<Item = &'a EdgeIndex> + 'a {
        self.graph
            .edges_connecting_undirected(first_node_indices, second_node_indices)
    }

    fn add_node_impl(
        &mut self,
        node_index: NodeIndex,
        attributes: AttributeMap,
    ) -> GraphRecordResult<()> {
        match self.schema.schema_type() {
            SchemaType::Inferred => {
                let nodes_in_groups = self.group_mapping.nodes_in_group.len();

                let nodes_not_in_groups = self.graph.node_count() - nodes_in_groups;

                self.schema
                    .update_node(&attributes, None, nodes_not_in_groups == 0);
            }
            SchemaType::Provided => {
                self.schema.validate_node(&node_index, &attributes, None)?;
            }
        }

        self.graph.add_node(node_index, attributes)
    }

    // TODO: Add tests
    #[allow(clippy::needless_pass_by_value)]
    fn add_node_with_group_impl(
        &mut self,
        node_index: NodeIndex,
        attributes: AttributeMap,
        group: Group,
    ) -> GraphRecordResult<()> {
        match self.schema.schema_type() {
            SchemaType::Inferred => {
                let nodes_in_group = self
                    .group_mapping
                    .nodes_in_group
                    .get(&group)
                    .map_or(0, GrHashSet::len);

                self.schema
                    .update_node(&attributes, Some(&group), nodes_in_group == 0);
            }
            SchemaType::Provided => {
                self.schema
                    .validate_node(&node_index, &attributes, Some(&group))?;
            }
        }

        self.graph.add_node(node_index.clone(), attributes)?;

        self.group_mapping
            .add_node_to_group(group, node_index.clone())
            .inspect_err(|_| {
                self.graph
                    .remove_node(&node_index, &mut self.group_mapping)
                    .expect("Node must exist");
            })
    }

    fn add_node_with_groups_impl(
        &mut self,
        node_index: NodeIndex,
        attributes: AttributeMap,
        groups: impl AsRef<[Group]>,
    ) -> GraphRecordResult<()> {
        let groups = groups.as_ref();

        match groups.split_first() {
            None => self.add_node_impl(node_index, attributes),
            Some((first, rest)) => {
                self.add_node_with_group_impl(node_index.clone(), attributes, first.clone())?;

                for group in rest {
                    self.add_node_to_group_impl(group.clone(), node_index.clone())
                        .inspect_err(|_| {
                            self.graph
                                .remove_node(&node_index, &mut self.group_mapping)
                                .expect("Node must exist");
                        })?;
                }

                Ok(())
            }
        }
    }

    fn remove_node_impl(&mut self, node_index: &NodeIndex) -> GraphRecordResult<AttributeMap> {
        self.graph.remove_node(node_index, &mut self.group_mapping)
    }

    fn add_nodes_impl(&mut self, nodes: Vec<(NodeIndex, AttributeMap)>) -> GraphRecordResult<()> {
        for (node_index, attributes) in nodes {
            self.add_node_impl(node_index, attributes)?;
        }

        Ok(())
    }

    // TODO: Add tests
    #[allow(clippy::needless_pass_by_value)]
    fn add_nodes_with_group_impl(
        &mut self,
        nodes: Vec<(NodeIndex, AttributeMap)>,
        group: Group,
    ) -> GraphRecordResult<()> {
        if !self.contains_group(&group) {
            self.add_group_impl(group.clone(), None, None)?;
        }

        for (node_index, attributes) in nodes {
            self.add_node_with_group_impl(node_index, attributes, group.clone())?;
        }

        Ok(())
    }

    fn add_nodes_with_groups_impl(
        &mut self,
        nodes: Vec<(NodeIndex, AttributeMap)>,
        groups: impl AsRef<[Group]>,
    ) -> GraphRecordResult<()> {
        let groups = groups.as_ref();

        for group in groups {
            if !self.contains_group(group) {
                self.add_group_impl(group.clone(), None, None)?;
            }
        }

        for (node_index, attributes) in nodes {
            self.add_node_with_groups_impl(node_index, attributes, groups)?;
        }

        Ok(())
    }

    fn add_nodes_dataframes_impl(
        &mut self,
        nodes_dataframes: impl IntoIterator<Item = impl Into<NodeDataFrameInput>>,
    ) -> GraphRecordResult<()> {
        self.add_nodes_impl(node_dataframes_to_tuples(nodes_dataframes)?)
    }

    // TODO: Add tests
    fn add_nodes_dataframes_with_group_impl(
        &mut self,
        nodes_dataframes: impl IntoIterator<Item = impl Into<NodeDataFrameInput>>,
        group: Group,
    ) -> GraphRecordResult<()> {
        self.add_nodes_with_group_impl(node_dataframes_to_tuples(nodes_dataframes)?, group)
    }

    fn add_nodes_dataframes_with_groups_impl(
        &mut self,
        nodes_dataframes: impl IntoIterator<Item = impl Into<NodeDataFrameInput>>,
        groups: impl AsRef<[Group]>,
    ) -> GraphRecordResult<()> {
        self.add_nodes_with_groups_impl(node_dataframes_to_tuples(nodes_dataframes)?, groups)
    }

    #[allow(clippy::needless_pass_by_value)]
    fn add_edge_impl(
        &mut self,
        source_node_index: NodeIndex,
        target_node_index: NodeIndex,
        attributes: AttributeMap,
    ) -> GraphRecordResult<EdgeIndex> {
        let edge_index =
            self.graph
                .add_edge(source_node_index, target_node_index, attributes.clone())?;

        match self.schema.schema_type() {
            SchemaType::Inferred => {
                let edges_in_groups = self.group_mapping.edges_in_group.len();

                let edges_not_in_groups = self.graph.edge_count() - edges_in_groups;

                self.schema
                    .update_edge(&attributes, None, edges_not_in_groups <= 1);

                Ok(edge_index)
            }
            SchemaType::Provided => {
                match self.schema.validate_edge(&edge_index, &attributes, None) {
                    Ok(()) => Ok(edge_index),
                    Err(e) => {
                        self.graph
                            .remove_edge(&edge_index)
                            .expect("Edge must exist");

                        Err(e.into())
                    }
                }
            }
        }
    }

    // TODO: Add tests
    #[allow(clippy::needless_pass_by_value)]
    fn add_edge_with_group_impl(
        &mut self,
        source_node_index: NodeIndex,
        target_node_index: NodeIndex,
        attributes: AttributeMap,
        group: Group,
    ) -> GraphRecordResult<EdgeIndex> {
        let edge_index =
            self.graph
                .add_edge(source_node_index, target_node_index, attributes.clone())?;

        match self.schema.schema_type() {
            SchemaType::Inferred => {
                let edges_in_group = self
                    .group_mapping
                    .edges_in_group
                    .get(&group)
                    .map_or(0, GrHashSet::len);

                self.schema
                    .update_edge(&attributes, Some(&group), edges_in_group == 0);
            }
            SchemaType::Provided => {
                self.schema
                    .validate_edge(&edge_index, &attributes, Some(&group))
                    .inspect_err(|_| {
                        self.graph
                            .remove_edge(&edge_index)
                            .expect("Edge must exist");
                    })?;
            }
        }

        self.group_mapping
            .add_edge_to_group(group, edge_index)
            .inspect_err(|_| {
                self.graph
                    .remove_edge(&edge_index)
                    .expect("Edge must exist");
            })?;

        Ok(edge_index)
    }

    fn add_edge_with_groups_impl(
        &mut self,
        source_node_index: NodeIndex,
        target_node_index: NodeIndex,
        attributes: AttributeMap,
        groups: impl AsRef<[Group]>,
    ) -> GraphRecordResult<EdgeIndex> {
        let groups = groups.as_ref();

        match groups.split_first() {
            None => self.add_edge_impl(source_node_index, target_node_index, attributes),
            Some((first, rest)) => {
                let edge_index = self.add_edge_with_group_impl(
                    source_node_index,
                    target_node_index,
                    attributes,
                    first.clone(),
                )?;

                for group in rest {
                    self.add_edge_to_group_impl(group.clone(), edge_index)
                        .inspect_err(|_| {
                            self.graph
                                .remove_edge(&edge_index)
                                .expect("Edge must exist");
                        })?;
                }

                Ok(edge_index)
            }
        }
    }

    #[allow(clippy::trivially_copy_pass_by_ref)]
    fn remove_edge_impl(&mut self, edge_index: &EdgeIndex) -> GraphRecordResult<AttributeMap> {
        self.group_mapping.remove_edge(edge_index);

        self.graph.remove_edge(edge_index)
    }

    fn add_edges_impl(
        &mut self,
        edges: Vec<(NodeIndex, NodeIndex, AttributeMap)>,
    ) -> GraphRecordResult<Vec<EdgeIndex>> {
        edges
            .into_iter()
            .map(|(source_node_index, target_node_index, attributes)| {
                self.add_edge_impl(source_node_index, target_node_index, attributes)
            })
            .collect()
    }

    // TODO: Add tests
    fn add_edges_with_group_impl(
        &mut self,
        edges: Vec<(NodeIndex, NodeIndex, AttributeMap)>,
        group: &Group,
    ) -> GraphRecordResult<Vec<EdgeIndex>> {
        if !self.contains_group(group) {
            self.add_group_impl(group.clone(), None, None)?;
        }

        edges
            .into_iter()
            .map(|(source_node_index, target_node_index, attributes)| {
                self.add_edge_with_group_impl(
                    source_node_index,
                    target_node_index,
                    attributes,
                    group.clone(),
                )
            })
            .collect()
    }

    fn add_edges_with_groups_impl(
        &mut self,
        edges: Vec<(NodeIndex, NodeIndex, AttributeMap)>,
        groups: impl AsRef<[Group]>,
    ) -> GraphRecordResult<Vec<EdgeIndex>> {
        let groups = groups.as_ref();

        for group in groups {
            if !self.contains_group(group) {
                self.add_group_impl(group.clone(), None, None)?;
            }
        }

        edges
            .into_iter()
            .map(|(source_node_index, target_node_index, attributes)| {
                self.add_edge_with_groups_impl(
                    source_node_index,
                    target_node_index,
                    attributes,
                    groups,
                )
            })
            .collect()
    }

    fn add_edges_dataframes_impl(
        &mut self,
        edges_dataframes: impl IntoIterator<Item = impl Into<EdgeDataFrameInput>>,
    ) -> GraphRecordResult<Vec<EdgeIndex>> {
        self.add_edges_impl(edge_dataframes_to_tuples(edges_dataframes)?)
    }

    // TODO: Add tests
    fn add_edges_dataframes_with_group_impl(
        &mut self,
        edges_dataframes: impl IntoIterator<Item = impl Into<EdgeDataFrameInput>>,
        group: &Group,
    ) -> GraphRecordResult<Vec<EdgeIndex>> {
        self.add_edges_with_group_impl(edge_dataframes_to_tuples(edges_dataframes)?, group)
    }

    fn add_edges_dataframes_with_groups_impl(
        &mut self,
        edges_dataframes: impl IntoIterator<Item = impl Into<EdgeDataFrameInput>>,
        groups: impl AsRef<[Group]>,
    ) -> GraphRecordResult<Vec<EdgeIndex>> {
        self.add_edges_with_groups_impl(edge_dataframes_to_tuples(edges_dataframes)?, groups)
    }

    fn add_group_impl(
        &mut self,
        group: Group,
        node_indices: Option<Vec<NodeIndex>>,
        edge_indices: Option<Vec<EdgeIndex>>,
    ) -> GraphRecordResult<()> {
        if self.group_mapping.contains_group(&group) {
            return Err(GraphRecordError::GroupAlreadyExists {
                group: group.clone(),
            });
        }

        if let Some(ref node_indices) = node_indices {
            for node_index in node_indices {
                if !self.graph.contains_node(node_index) {
                    return Err(GraphRecordError::NodeNotFound {
                        node_index: node_index.clone(),
                    });
                }
            }
        }

        if let Some(ref edge_indices) = edge_indices {
            for edge_index in edge_indices {
                if !self.graph.contains_edge(edge_index) {
                    return Err(GraphRecordError::EdgeNotFound {
                        edge_index: *edge_index,
                    });
                }
            }
        }

        match self.schema.schema_type() {
            SchemaType::Inferred => {
                if !self.schema.groups().contains_key(&group) {
                    self.schema
                        .add_group(group.clone(), GroupSchema::default())?;
                }

                if let Some(ref node_indices) = node_indices {
                    let mut empty = true;

                    for node_index in node_indices {
                        let node_attributes = self.graph.node_attributes(node_index)?;

                        self.schema
                            .update_node(node_attributes, Some(&group), empty);

                        empty = false;
                    }
                }

                if let Some(ref edge_indices) = edge_indices {
                    let mut empty = true;

                    for edge_index in edge_indices {
                        let edge_attributes = self.graph.edge_attributes(edge_index)?;

                        self.schema
                            .update_edge(edge_attributes, Some(&group), empty);

                        empty = false;
                    }
                }
            }
            SchemaType::Provided => {
                if !self.schema.groups().contains_key(&group) {
                    return Err(SchemaError::GroupNotInSchema {
                        group: group.clone(),
                    }
                    .into());
                }

                if let Some(ref node_indices) = node_indices {
                    for node_index in node_indices {
                        let node_attributes = self.graph.node_attributes(node_index)?;

                        self.schema
                            .validate_node(node_index, node_attributes, Some(&group))?;
                    }
                }

                if let Some(ref edge_indices) = edge_indices {
                    for edge_index in edge_indices {
                        let edge_attributes = self.graph.edge_attributes(edge_index)?;

                        self.schema
                            .validate_edge(edge_index, edge_attributes, Some(&group))?;
                    }
                }
            }
        }

        self.group_mapping
            .add_group(group, node_indices, edge_indices)
            .expect("Group must not exist");

        Ok(())
    }

    fn remove_group_impl(&mut self, group: &Group) -> GraphRecordResult<()> {
        self.group_mapping.remove_group(group)
    }

    fn add_node_to_group_impl(
        &mut self,
        group: Group,
        node_index: NodeIndex,
    ) -> GraphRecordResult<()> {
        let node_attributes = self.graph.node_attributes(&node_index)?;

        match self.schema.schema_type() {
            SchemaType::Inferred => {
                let nodes_in_group = self
                    .group_mapping
                    .nodes_in_group
                    .get(&group)
                    .map_or(0, GrHashSet::len);

                self.schema
                    .update_node(node_attributes, Some(&group), nodes_in_group == 0);
            }
            SchemaType::Provided => {
                self.schema
                    .validate_node(&node_index, node_attributes, Some(&group))?;
            }
        }

        self.group_mapping.add_node_to_group(group, node_index)
    }

    #[allow(clippy::needless_pass_by_value)]
    fn add_node_to_groups_impl(
        &mut self,
        groups: impl AsRef<[Group]>,
        node_index: NodeIndex,
    ) -> GraphRecordResult<()> {
        groups
            .as_ref()
            .iter()
            .try_for_each(|group| self.add_node_to_group_impl(group.clone(), node_index.clone()))
    }

    fn add_nodes_to_groups_impl(
        &mut self,
        groups: impl AsRef<[Group]>,
        node_indices: Vec<NodeIndex>,
    ) -> GraphRecordResult<()> {
        let groups = groups.as_ref();

        node_indices
            .into_iter()
            .try_for_each(|node_index| self.add_node_to_groups_impl(groups, node_index))
    }

    fn add_edge_to_group_impl(
        &mut self,
        group: Group,
        edge_index: EdgeIndex,
    ) -> GraphRecordResult<()> {
        let edge_attributes = self.graph.edge_attributes(&edge_index)?;

        match self.schema.schema_type() {
            SchemaType::Inferred => {
                let edges_in_group = self
                    .group_mapping
                    .edges_in_group
                    .get(&group)
                    .map_or(0, GrHashSet::len);

                self.schema
                    .update_edge(edge_attributes, Some(&group), edges_in_group == 0);
            }
            SchemaType::Provided => {
                self.schema
                    .validate_edge(&edge_index, edge_attributes, Some(&group))?;
            }
        }

        self.group_mapping.add_edge_to_group(group, edge_index)
    }

    fn add_edge_to_groups_impl(
        &mut self,
        groups: impl AsRef<[Group]>,
        edge_index: EdgeIndex,
    ) -> GraphRecordResult<()> {
        groups
            .as_ref()
            .iter()
            .try_for_each(|group| self.add_edge_to_group_impl(group.clone(), edge_index))
    }

    fn add_edges_to_groups_impl(
        &mut self,
        groups: impl AsRef<[Group]>,
        edge_indices: Vec<EdgeIndex>,
    ) -> GraphRecordResult<()> {
        let groups = groups.as_ref();

        edge_indices
            .into_iter()
            .try_for_each(|edge_index| self.add_edge_to_groups_impl(groups, edge_index))
    }

    fn remove_node_from_group_impl(
        &mut self,
        group: &Group,
        node_index: &NodeIndex,
    ) -> GraphRecordResult<()> {
        if !self.graph.contains_node(node_index) {
            return Err(GraphRecordError::NodeNotFound {
                node_index: node_index.clone(),
            });
        }

        self.group_mapping.remove_node_from_group(group, node_index)
    }

    fn remove_node_from_groups_impl(
        &mut self,
        groups: impl AsRef<[Group]>,
        node_index: &NodeIndex,
    ) -> GraphRecordResult<()> {
        groups
            .as_ref()
            .iter()
            .try_for_each(|group| self.remove_node_from_group_impl(group, node_index))
    }

    fn remove_nodes_from_groups_impl(
        &mut self,
        groups: impl AsRef<[Group]>,
        node_indices: &[NodeIndex],
    ) -> GraphRecordResult<()> {
        let groups = groups.as_ref();

        node_indices
            .iter()
            .try_for_each(|node_index| self.remove_node_from_groups_impl(groups, node_index))
    }

    #[allow(clippy::trivially_copy_pass_by_ref)]
    fn remove_edge_from_group_impl(
        &mut self,
        group: &Group,
        edge_index: &EdgeIndex,
    ) -> GraphRecordResult<()> {
        if !self.graph.contains_edge(edge_index) {
            return Err(GraphRecordError::EdgeNotFound {
                edge_index: *edge_index,
            });
        }

        self.group_mapping.remove_edge_from_group(group, edge_index)
    }

    #[allow(clippy::trivially_copy_pass_by_ref)]
    fn remove_edge_from_groups_impl(
        &mut self,
        groups: impl AsRef<[Group]>,
        edge_index: &EdgeIndex,
    ) -> GraphRecordResult<()> {
        groups
            .as_ref()
            .iter()
            .try_for_each(|group| self.remove_edge_from_group_impl(group, edge_index))
    }

    fn remove_edges_from_groups_impl(
        &mut self,
        groups: impl AsRef<[Group]>,
        edge_indices: &[EdgeIndex],
    ) -> GraphRecordResult<()> {
        let groups = groups.as_ref();

        edge_indices
            .iter()
            .try_for_each(|edge_index| self.remove_edge_from_groups_impl(groups, edge_index))
    }

    pub fn groups(&self) -> impl Iterator<Item = &Group> {
        self.group_mapping.groups()
    }

    pub fn nodes_in_group(
        &self,
        group: &Group,
    ) -> GraphRecordResult<impl Iterator<Item = &NodeIndex> + use<'_>> {
        self.group_mapping.nodes_in_group(group)
    }

    pub fn ungrouped_nodes(&self) -> impl Iterator<Item = &NodeIndex> {
        let nodes_in_groups: GrHashSet<_> = self
            .group_mapping
            .nodes_in_group
            .values()
            .flat_map(|nodes| nodes.iter())
            .collect();

        self.graph
            .node_indices()
            .filter(move |node_index| !nodes_in_groups.contains(*node_index))
    }

    pub fn edges_in_group(
        &self,
        group: &Group,
    ) -> GraphRecordResult<impl Iterator<Item = &EdgeIndex> + use<'_>> {
        self.group_mapping.edges_in_group(group)
    }

    pub fn ungrouped_edges(&self) -> impl Iterator<Item = &EdgeIndex> {
        let edges_in_groups: GrHashSet<_> = self
            .group_mapping
            .edges_in_group
            .values()
            .flat_map(|edges| edges.iter())
            .collect();

        self.graph
            .edge_indices()
            .filter(move |edge_index| !edges_in_groups.contains(*edge_index))
    }

    pub fn groups_of_node(
        &self,
        node_index: &NodeIndex,
    ) -> GraphRecordResult<impl Iterator<Item = &Group> + use<'_>> {
        if !self.graph.contains_node(node_index) {
            return Err(GraphRecordError::NodeNotFound {
                node_index: node_index.clone(),
            });
        }

        Ok(self.group_mapping.groups_of_node(node_index))
    }

    pub fn groups_of_edge(
        &self,
        edge_index: &EdgeIndex,
    ) -> GraphRecordResult<impl Iterator<Item = &Group> + use<'_>> {
        if !self.graph.contains_edge(edge_index) {
            return Err(GraphRecordError::EdgeNotFound {
                edge_index: *edge_index,
            });
        }

        Ok(self.group_mapping.groups_of_edge(edge_index))
    }

    #[must_use]
    pub fn node_count(&self) -> usize {
        self.graph.node_count()
    }

    #[must_use]
    pub fn edge_count(&self) -> usize {
        self.graph.edge_count()
    }

    #[must_use]
    pub fn group_count(&self) -> usize {
        self.group_mapping.group_count()
    }

    #[must_use]
    pub fn contains_node(&self, node_index: &NodeIndex) -> bool {
        self.graph.contains_node(node_index)
    }

    #[must_use]
    pub fn contains_edge(&self, edge_index: &EdgeIndex) -> bool {
        self.graph.contains_edge(edge_index)
    }

    #[must_use]
    pub fn contains_group(&self, group: &Group) -> bool {
        self.group_mapping.contains_group(group)
    }

    pub fn outgoing_neighbors(
        &self,
        node_index: &NodeIndex,
    ) -> GraphRecordResult<impl Iterator<Item = &NodeIndex> + use<'_>> {
        self.graph.outgoing_neighbors(node_index)
    }

    // TODO: Add tests
    pub fn incoming_neighbors(
        &self,
        node_index: &NodeIndex,
    ) -> GraphRecordResult<impl Iterator<Item = &NodeIndex> + use<'_>> {
        self.graph.incoming_neighbors(node_index)
    }

    pub fn neighbors(
        &self,
        node_index: &NodeIndex,
    ) -> GraphRecordResult<impl Iterator<Item = &NodeIndex> + use<'_>> {
        self.graph.neighbors(node_index)
    }

    fn clear_impl(&mut self) {
        self.graph.clear();
        self.group_mapping.clear();
    }
}

#[cfg(not(feature = "plugins"))]
impl GraphRecord {
    pub fn set_schema(&mut self, schema: Schema) -> GraphRecordResult<()> {
        self.set_schema_impl(schema)
    }

    pub const fn freeze_schema(&mut self) -> GraphRecordResult<()> {
        self.freeze_schema_impl();

        Ok(())
    }

    pub const fn unfreeze_schema(&mut self) -> GraphRecordResult<()> {
        self.unfreeze_schema_impl();

        Ok(())
    }

    pub fn add_node(
        &mut self,
        node_index: NodeIndex,
        attributes: AttributeMap,
    ) -> GraphRecordResult<()> {
        self.add_node_impl(node_index, attributes)
    }

    #[allow(clippy::needless_pass_by_value)]
    pub fn add_node_with_group(
        &mut self,
        node_index: NodeIndex,
        attributes: AttributeMap,
        group: Group,
    ) -> GraphRecordResult<()> {
        self.add_node_with_group_impl(node_index, attributes, group)
    }

    pub fn add_node_with_groups(
        &mut self,
        node_index: NodeIndex,
        attributes: AttributeMap,
        groups: impl AsRef<[Group]>,
    ) -> GraphRecordResult<()> {
        self.add_node_with_groups_impl(node_index, attributes, groups)
    }

    pub fn remove_node(&mut self, node_index: &NodeIndex) -> GraphRecordResult<AttributeMap> {
        self.remove_node_impl(node_index)
    }

    pub fn add_nodes(&mut self, nodes: Vec<(NodeIndex, AttributeMap)>) -> GraphRecordResult<()> {
        self.add_nodes_impl(nodes)
    }

    #[allow(clippy::needless_pass_by_value)]
    pub fn add_nodes_with_group(
        &mut self,
        nodes: Vec<(NodeIndex, AttributeMap)>,
        group: Group,
    ) -> GraphRecordResult<()> {
        self.add_nodes_with_group_impl(nodes, group)
    }

    pub fn add_nodes_with_groups(
        &mut self,
        nodes: Vec<(NodeIndex, AttributeMap)>,
        groups: impl AsRef<[Group]>,
    ) -> GraphRecordResult<()> {
        self.add_nodes_with_groups_impl(nodes, groups)
    }

    pub fn add_nodes_dataframes(
        &mut self,
        nodes_dataframes: impl IntoIterator<Item = impl Into<NodeDataFrameInput>>,
    ) -> GraphRecordResult<()> {
        self.add_nodes_dataframes_impl(nodes_dataframes)
    }

    pub fn add_nodes_dataframes_with_group(
        &mut self,
        nodes_dataframes: impl IntoIterator<Item = impl Into<NodeDataFrameInput>>,
        group: Group,
    ) -> GraphRecordResult<()> {
        self.add_nodes_dataframes_with_group_impl(nodes_dataframes, group)
    }

    pub fn add_nodes_dataframes_with_groups(
        &mut self,
        nodes_dataframes: impl IntoIterator<Item = impl Into<NodeDataFrameInput>>,
        groups: impl AsRef<[Group]>,
    ) -> GraphRecordResult<()> {
        self.add_nodes_dataframes_with_groups_impl(nodes_dataframes, groups)
    }

    #[allow(clippy::needless_pass_by_value)]
    pub fn add_edge(
        &mut self,
        source_node_index: NodeIndex,
        target_node_index: NodeIndex,
        attributes: AttributeMap,
    ) -> GraphRecordResult<EdgeIndex> {
        self.add_edge_impl(source_node_index, target_node_index, attributes)
    }

    #[allow(clippy::needless_pass_by_value)]
    pub fn add_edge_with_group(
        &mut self,
        source_node_index: NodeIndex,
        target_node_index: NodeIndex,
        attributes: AttributeMap,
        group: Group,
    ) -> GraphRecordResult<EdgeIndex> {
        self.add_edge_with_group_impl(source_node_index, target_node_index, attributes, group)
    }

    pub fn add_edge_with_groups(
        &mut self,
        source_node_index: NodeIndex,
        target_node_index: NodeIndex,
        attributes: AttributeMap,
        groups: impl AsRef<[Group]>,
    ) -> GraphRecordResult<EdgeIndex> {
        self.add_edge_with_groups_impl(source_node_index, target_node_index, attributes, groups)
    }

    pub fn remove_edge(&mut self, edge_index: &EdgeIndex) -> GraphRecordResult<AttributeMap> {
        self.remove_edge_impl(edge_index)
    }

    pub fn add_edges(
        &mut self,
        edges: Vec<(NodeIndex, NodeIndex, AttributeMap)>,
    ) -> GraphRecordResult<Vec<EdgeIndex>> {
        self.add_edges_impl(edges)
    }

    pub fn add_edges_with_group(
        &mut self,
        edges: Vec<(NodeIndex, NodeIndex, AttributeMap)>,
        group: &Group,
    ) -> GraphRecordResult<Vec<EdgeIndex>> {
        self.add_edges_with_group_impl(edges, group)
    }

    pub fn add_edges_with_groups(
        &mut self,
        edges: Vec<(NodeIndex, NodeIndex, AttributeMap)>,
        groups: impl AsRef<[Group]>,
    ) -> GraphRecordResult<Vec<EdgeIndex>> {
        self.add_edges_with_groups_impl(edges, groups)
    }

    pub fn add_edges_dataframes(
        &mut self,
        edges_dataframes: impl IntoIterator<Item = impl Into<EdgeDataFrameInput>>,
    ) -> GraphRecordResult<Vec<EdgeIndex>> {
        self.add_edges_dataframes_impl(edges_dataframes)
    }

    pub fn add_edges_dataframes_with_group(
        &mut self,
        edges_dataframes: impl IntoIterator<Item = impl Into<EdgeDataFrameInput>>,
        group: &Group,
    ) -> GraphRecordResult<Vec<EdgeIndex>> {
        self.add_edges_dataframes_with_group_impl(edges_dataframes, group)
    }

    pub fn add_edges_dataframes_with_groups(
        &mut self,
        edges_dataframes: impl IntoIterator<Item = impl Into<EdgeDataFrameInput>>,
        groups: impl AsRef<[Group]>,
    ) -> GraphRecordResult<Vec<EdgeIndex>> {
        self.add_edges_dataframes_with_groups_impl(edges_dataframes, groups)
    }

    pub fn add_group(
        &mut self,
        group: Group,
        node_indices: Option<Vec<NodeIndex>>,
        edge_indices: Option<Vec<EdgeIndex>>,
    ) -> GraphRecordResult<()> {
        self.add_group_impl(group, node_indices, edge_indices)
    }

    pub fn remove_group(&mut self, group: &Group) -> GraphRecordResult<()> {
        self.remove_group_impl(group)
    }

    pub fn add_node_to_group(
        &mut self,
        group: Group,
        node_index: NodeIndex,
    ) -> GraphRecordResult<()> {
        self.add_node_to_group_impl(group, node_index)
    }

    pub fn add_node_to_groups(
        &mut self,
        groups: impl AsRef<[Group]>,
        node_index: NodeIndex,
    ) -> GraphRecordResult<()> {
        self.add_node_to_groups_impl(groups, node_index)
    }

    pub fn add_nodes_to_groups(
        &mut self,
        groups: impl AsRef<[Group]>,
        node_indices: Vec<NodeIndex>,
    ) -> GraphRecordResult<()> {
        self.add_nodes_to_groups_impl(groups, node_indices)
    }

    pub fn add_edge_to_group(
        &mut self,
        group: Group,
        edge_index: EdgeIndex,
    ) -> GraphRecordResult<()> {
        self.add_edge_to_group_impl(group, edge_index)
    }

    pub fn add_edge_to_groups(
        &mut self,
        groups: impl AsRef<[Group]>,
        edge_index: EdgeIndex,
    ) -> GraphRecordResult<()> {
        self.add_edge_to_groups_impl(groups, edge_index)
    }

    pub fn add_edges_to_groups(
        &mut self,
        groups: impl AsRef<[Group]>,
        edge_indices: Vec<EdgeIndex>,
    ) -> GraphRecordResult<()> {
        self.add_edges_to_groups_impl(groups, edge_indices)
    }

    pub fn remove_node_from_group(
        &mut self,
        group: &Group,
        node_index: &NodeIndex,
    ) -> GraphRecordResult<()> {
        self.remove_node_from_group_impl(group, node_index)
    }

    pub fn remove_node_from_groups(
        &mut self,
        groups: impl AsRef<[Group]>,
        node_index: &NodeIndex,
    ) -> GraphRecordResult<()> {
        self.remove_node_from_groups_impl(groups, node_index)
    }

    pub fn remove_nodes_from_groups(
        &mut self,
        groups: impl AsRef<[Group]>,
        node_indices: &[NodeIndex],
    ) -> GraphRecordResult<()> {
        self.remove_nodes_from_groups_impl(groups, node_indices)
    }

    pub fn remove_edge_from_group(
        &mut self,
        group: &Group,
        edge_index: &EdgeIndex,
    ) -> GraphRecordResult<()> {
        self.remove_edge_from_group_impl(group, edge_index)
    }

    pub fn remove_edge_from_groups(
        &mut self,
        groups: impl AsRef<[Group]>,
        edge_index: &EdgeIndex,
    ) -> GraphRecordResult<()> {
        self.remove_edge_from_groups_impl(groups, edge_index)
    }

    pub fn remove_edges_from_groups(
        &mut self,
        groups: impl AsRef<[Group]>,
        edge_indices: &[EdgeIndex],
    ) -> GraphRecordResult<()> {
        self.remove_edges_from_groups_impl(groups, edge_indices)
    }

    pub fn clear(&mut self) -> GraphRecordResult<()> {
        self.clear_impl();

        Ok(())
    }
}

#[cfg(test)]
mod test {
    use super::{
        AttributeMap, EdgeDataFrameInput, GraphRecord, GraphRecordAttribute, NodeDataFrameInput,
        NodeIndex,
    };
    use crate::{
        errors::{GraphRecordError, SchemaError},
        graphrecord::{
            SchemaType,
            datatypes::DataType,
            schema::{AttributeSchema, GroupSchema, Schema},
        },
    };
    use polars::prelude::{DataFrame, NamedFrom, PolarsError, Series};
    use std::collections::HashMap;
    #[cfg(feature = "serde")]
    use std::fs;

    fn create_nodes() -> Vec<(NodeIndex, AttributeMap)> {
        vec![
            (
                "0".into(),
                HashMap::from([("lorem".into(), "ipsum".into())]),
            ),
            (
                "1".into(),
                HashMap::from([("amet".into(), "consectetur".into())]),
            ),
            (
                "2".into(),
                HashMap::from([("adipiscing".into(), "elit".into())]),
            ),
            ("3".into(), HashMap::new()),
        ]
    }

    fn create_edges() -> Vec<(NodeIndex, NodeIndex, AttributeMap)> {
        vec![
            (
                "0".into(),
                "1".into(),
                HashMap::from([
                    ("sed".into(), "do".into()),
                    ("eiusmod".into(), "tempor".into()),
                ]),
            ),
            (
                "1".into(),
                "0".into(),
                HashMap::from([
                    ("sed".into(), "do".into()),
                    ("eiusmod".into(), "tempor".into()),
                ]),
            ),
            (
                "1".into(),
                "2".into(),
                HashMap::from([("incididunt".into(), "ut".into())]),
            ),
            ("0".into(), "2".into(), HashMap::new()),
        ]
    }

    fn create_nodes_dataframe() -> Result<DataFrame, PolarsError> {
        let s0 = Series::new("index".into(), &["0", "1"]);
        let s1 = Series::new("attribute".into(), &[1, 2]);
        DataFrame::new(2, vec![s0.into(), s1.into()])
    }

    fn create_edges_dataframe() -> Result<DataFrame, PolarsError> {
        let s0 = Series::new("from".into(), &["0", "1"]);
        let s1 = Series::new("to".into(), &["1", "0"]);
        let s2 = Series::new("attribute".into(), &[1, 2]);
        DataFrame::new(2, vec![s0.into(), s1.into(), s2.into()])
    }

    fn create_graphrecord() -> GraphRecord {
        let nodes = create_nodes();
        let edges = create_edges();

        GraphRecord::from_tuples(nodes, Some(edges), None).unwrap()
    }

    #[test]
    fn test_from_tuples() {
        let graphrecord = create_graphrecord();

        assert_eq!(4, graphrecord.node_count());
        assert_eq!(4, graphrecord.edge_count());
    }

    #[test]
    fn test_invalid_from_tuples() {
        let nodes = create_nodes();

        // Adding an edge pointing to a non-existing node should fail
        assert!(
            GraphRecord::from_tuples(
                nodes.clone(),
                Some(vec![("0".into(), "50".into(), HashMap::new())]),
                None
            )
            .is_err_and(|e| matches!(e, GraphRecordError::NodeNotFound { .. }))
        );

        // Adding an edge from a non-existing should fail
        assert!(
            GraphRecord::from_tuples(
                nodes,
                Some(vec![("50".into(), "0".into(), HashMap::new())]),
                None
            )
            .is_err_and(|e| matches!(e, GraphRecordError::NodeNotFound { .. }))
        );
    }

    #[test]
    fn test_from_dataframes() {
        let nodes_dataframe = create_nodes_dataframe().unwrap();
        let edges_dataframe = create_edges_dataframe().unwrap();

        let graphrecord = GraphRecord::from_dataframes(
            vec![(nodes_dataframe, "index".to_string())],
            vec![(edges_dataframe, "from".to_string(), "to".to_string())],
            None,
        )
        .unwrap();

        assert_eq!(2, graphrecord.node_count());
        assert_eq!(2, graphrecord.edge_count());
    }

    #[test]
    fn test_from_nodes_dataframes() {
        let nodes_dataframe = create_nodes_dataframe().unwrap();

        let graphrecord =
            GraphRecord::from_nodes_dataframes(vec![(nodes_dataframe, "index".to_string())], None)
                .unwrap();

        assert_eq!(2, graphrecord.node_count());
    }

    #[test]
    #[cfg(feature = "serde")]
    fn test_ron() {
        let graphrecord = create_graphrecord();

        let mut file_path = std::env::temp_dir().into_os_string();
        file_path.push("/graphrecord_test/");

        fs::create_dir_all(&file_path).unwrap();

        file_path.push("test.ron");

        graphrecord.to_ron(&file_path).unwrap();

        let loaded_graphrecord = GraphRecord::from_ron(&file_path).unwrap();

        assert_eq!(graphrecord.node_count(), loaded_graphrecord.node_count());
        assert_eq!(graphrecord.edge_count(), loaded_graphrecord.edge_count());
    }

    #[test]
    fn test_set_schema() {
        let mut graphrecord = GraphRecord::new();

        let group_schema = GroupSchema::new(
            AttributeSchema::from([("attribute".into(), DataType::Int.into())]),
            AttributeSchema::from([("attribute".into(), DataType::Int.into())]),
        );

        graphrecord
            .add_node("0".into(), HashMap::from([("attribute".into(), 1.into())]))
            .unwrap();
        graphrecord
            .add_node("1".into(), HashMap::from([("attribute".into(), 1.into())]))
            .unwrap();
        graphrecord
            .add_edge(
                "0".into(),
                "1".into(),
                HashMap::from([("attribute".into(), 1.into())]),
            )
            .unwrap();

        let schema = Schema::new_provided(HashMap::default(), group_schema.clone());

        assert!(graphrecord.set_schema(schema.clone()).is_ok());

        assert_eq!(schema, *graphrecord.get_schema());

        let mut graphrecord = GraphRecord::new();

        graphrecord
            .add_node("0".into(), HashMap::from([("attribute".into(), 1.into())]))
            .unwrap();
        graphrecord
            .add_node("1".into(), HashMap::from([("attribute".into(), 1.into())]))
            .unwrap();
        graphrecord
            .add_node("2".into(), HashMap::from([("attribute".into(), 1.into())]))
            .unwrap();
        graphrecord
            .add_edge(
                "0".into(),
                "1".into(),
                HashMap::from([("attribute".into(), 1.into())]),
            )
            .unwrap();
        graphrecord
            .add_edge(
                "0".into(),
                "1".into(),
                HashMap::from([("attribute".into(), 1.into())]),
            )
            .unwrap();
        graphrecord
            .add_edge(
                "0".into(),
                "1".into(),
                HashMap::from([("attribute".into(), 1.into())]),
            )
            .unwrap();

        let schema = Schema::new_inferred(
            HashMap::from([
                ("0".into(), group_schema.clone()),
                ("1".into(), group_schema.clone()),
            ]),
            group_schema,
        );

        graphrecord
            .add_group(
                "0".into(),
                Some(vec!["0".into(), "1".into()]),
                Some(vec![0, 1]),
            )
            .unwrap();
        graphrecord
            .add_group(
                "1".into(),
                Some(vec!["0".into(), "1".into()]),
                Some(vec![0, 1]),
            )
            .unwrap();

        let inferred_schema = Schema::new_inferred(HashMap::default(), GroupSchema::default());

        assert!(graphrecord.set_schema(inferred_schema).is_ok());

        assert_eq!(schema, *graphrecord.get_schema());
    }

    #[test]
    fn test_invalid_set_schema() {
        let mut graphrecord = GraphRecord::new();

        graphrecord
            .add_node("0".into(), HashMap::from([("attribute2".into(), 1.into())]))
            .unwrap();

        let schema = Schema::new_provided(
            HashMap::default(),
            GroupSchema::new(
                AttributeSchema::from([("attribute".into(), DataType::Int.into())]),
                AttributeSchema::from([("attribute".into(), DataType::Int.into())]),
            ),
        );

        let previous_schema = graphrecord.get_schema().clone();

        assert!(
            graphrecord
                .set_schema(schema.clone())
                .is_err_and(|e| { matches!(e, GraphRecordError::Schema(_)) })
        );

        assert_eq!(previous_schema, *graphrecord.get_schema());

        let mut graphrecord = GraphRecord::new();

        graphrecord
            .add_node("0".into(), HashMap::from([("attribute".into(), 1.into())]))
            .unwrap();
        graphrecord
            .add_node("1".into(), HashMap::from([("attribute".into(), 1.into())]))
            .unwrap();
        graphrecord
            .add_edge(
                "0".into(),
                "1".into(),
                HashMap::from([("attribute2".into(), 1.into())]),
            )
            .unwrap();

        let previous_schema = graphrecord.get_schema().clone();

        assert!(
            graphrecord
                .set_schema(schema)
                .is_err_and(|e| { matches!(e, GraphRecordError::Schema(_)) })
        );

        assert_eq!(previous_schema, *graphrecord.get_schema());
    }

    #[test]
    fn test_freeze_schema() {
        let mut graphrecord = GraphRecord::new();

        assert_eq!(
            SchemaType::Inferred,
            *graphrecord.get_schema().schema_type()
        );

        graphrecord.freeze_schema().unwrap();

        assert_eq!(
            SchemaType::Provided,
            *graphrecord.get_schema().schema_type()
        );
    }

    #[test]
    fn test_unfreeze_schema() {
        let schema = Schema::new_provided(HashMap::default(), GroupSchema::default());
        let mut graphrecord = GraphRecord::with_schema(schema);

        assert_eq!(
            *graphrecord.get_schema().schema_type(),
            SchemaType::Provided
        );

        graphrecord.unfreeze_schema().unwrap();

        assert_eq!(
            *graphrecord.get_schema().schema_type(),
            SchemaType::Inferred
        );
    }

    #[test]
    fn test_node_indices() {
        let graphrecord = create_graphrecord();

        let node_indices: Vec<_> = create_nodes()
            .into_iter()
            .map(|(node_index, _)| node_index)
            .collect();

        for node_index in graphrecord.node_indices() {
            assert!(node_indices.contains(node_index));
        }
    }

    #[test]
    fn test_node_attributes() {
        let graphrecord = create_graphrecord();

        let attributes = graphrecord.node_attributes(&"0".into()).unwrap();

        assert_eq!(&create_nodes()[0].1, attributes);
    }

    #[test]
    fn test_invalid_node_attributes() {
        let graphrecord = create_graphrecord();

        // Querying a non-existing node should fail
        assert!(
            graphrecord
                .node_attributes(&"50".into())
                .is_err_and(|e| matches!(e, GraphRecordError::NodeNotFound { .. }))
        );
    }

    #[test]
    fn test_node_attributes_mut() {
        let mut graphrecord = create_graphrecord();

        let node_index = "0".into();
        let mut attributes = graphrecord.node_attributes_mut(&node_index).unwrap();

        let new_attributes = HashMap::from([("0".into(), "1".into()), ("2".into(), "3".into())]);

        attributes
            .replace_attributes(new_attributes.clone())
            .unwrap();

        assert_eq!(
            &new_attributes,
            graphrecord.node_attributes(&node_index).unwrap()
        );
    }

    #[test]
    fn test_invalid_node_attributes_mut() {
        let mut graphrecord = create_graphrecord();

        // Accessing the node attributes of a non-existing node should fail
        assert!(
            graphrecord
                .node_attributes_mut(&"50".into())
                .is_err_and(|e| matches!(e, GraphRecordError::NodeNotFound { .. }))
        );
    }

    #[test]
    fn test_outgoing_edges() {
        let graphrecord = create_graphrecord();

        let edges = graphrecord.outgoing_edges(&"0".into()).unwrap();

        assert_eq!(2, edges.count());
    }

    #[test]
    fn test_invalid_outgoing_edges() {
        let graphrecord = create_graphrecord();

        assert!(
            graphrecord
                .outgoing_edges(&"50".into())
                .is_err_and(|e| matches!(e, GraphRecordError::NodeNotFound { .. }))
        );
    }

    #[test]
    fn test_incoming_edges() {
        let graphrecord = create_graphrecord();

        let edges = graphrecord.incoming_edges(&"2".into()).unwrap();

        assert_eq!(2, edges.count());
    }

    #[test]
    fn test_invalid_incoming_edges() {
        let graphrecord = create_graphrecord();

        assert!(
            graphrecord
                .incoming_edges(&"50".into())
                .is_err_and(|e| matches!(e, GraphRecordError::NodeNotFound { .. }))
        );
    }

    #[test]
    fn test_edge_indices() {
        let graphrecord = create_graphrecord();
        let edges = [0, 1, 2, 3];

        for edge in graphrecord.edge_indices() {
            assert!(edges.contains(edge));
        }
    }

    #[test]
    fn test_edge_attributes() {
        let graphrecord = create_graphrecord();

        let attributes = graphrecord.edge_attributes(&0).unwrap();

        assert_eq!(&create_edges()[0].2, attributes);
    }

    #[test]
    fn test_invalid_edge_attributes() {
        let graphrecord = create_graphrecord();

        // Querying a non-existing node should fail
        assert!(
            graphrecord
                .edge_attributes(&50)
                .is_err_and(|e| matches!(e, GraphRecordError::EdgeNotFound { .. }))
        );
    }

    #[test]
    fn test_edge_attributes_mut() {
        let mut graphrecord = create_graphrecord();

        let mut attributes = graphrecord.edge_attributes_mut(&0).unwrap();

        let new_attributes = HashMap::from([("0".into(), "1".into()), ("2".into(), "3".into())]);

        attributes
            .replace_attributes(new_attributes.clone())
            .unwrap();

        assert_eq!(&new_attributes, graphrecord.edge_attributes(&0).unwrap());
    }

    #[test]
    fn test_invalid_edge_attributes_mut() {
        let mut graphrecord = create_graphrecord();

        // Accessing the edge attributes of a non-existing edge should fail
        assert!(
            graphrecord
                .edge_attributes_mut(&50)
                .is_err_and(|e| matches!(e, GraphRecordError::EdgeNotFound { .. }))
        );
    }

    #[test]
    fn test_edge_endpoints() {
        let graphrecord = create_graphrecord();

        let edge = &create_edges()[0];

        let endpoints = graphrecord.edge_endpoints(&0).unwrap();

        assert_eq!(&edge.0, endpoints.0);

        assert_eq!(&edge.1, endpoints.1);
    }

    #[test]
    fn test_invalid_edge_endpoints() {
        let graphrecord = create_graphrecord();

        // Accessing the edge endpoints of a non-existing edge should fail
        assert!(
            graphrecord
                .edge_endpoints(&50)
                .is_err_and(|e| matches!(e, GraphRecordError::EdgeNotFound { .. }))
        );
    }

    #[test]
    fn test_edges_connecting() {
        let graphrecord = create_graphrecord();

        let first_index = "0".into();
        let second_index = "1".into();
        let edges_connecting =
            graphrecord.edges_connecting(vec![&first_index], vec![&second_index]);

        assert_eq!(vec![&0], edges_connecting.collect::<Vec<_>>());

        let first_index = "0".into();
        let second_index = "3".into();
        let edges_connecting =
            graphrecord.edges_connecting(vec![&first_index], vec![&second_index]);

        assert_eq!(0, edges_connecting.count());

        let first_index = "0".into();
        let second_index = "1".into();
        let third_index = "2".into();
        let mut edges_connecting: Vec<_> = graphrecord
            .edges_connecting(vec![&first_index, &second_index], vec![&third_index])
            .collect();

        edges_connecting.sort();
        assert_eq!(vec![&2, &3], edges_connecting);

        let first_index = "0".into();
        let second_index = "1".into();
        let third_index = "2".into();
        let fourth_index = "3".into();
        let mut edges_connecting: Vec<_> = graphrecord
            .edges_connecting(
                vec![&first_index, &second_index],
                vec![&third_index, &fourth_index],
            )
            .collect();

        edges_connecting.sort();
        assert_eq!(vec![&2, &3], edges_connecting);
    }

    #[test]
    fn test_edges_connecting_undirected() {
        let graphrecord = create_graphrecord();

        let first_index = "0".into();
        let second_index = "1".into();
        let mut edges_connecting: Vec<_> = graphrecord
            .edges_connecting_undirected(vec![&first_index], vec![&second_index])
            .collect();

        edges_connecting.sort();
        assert_eq!(vec![&0, &1], edges_connecting);
    }

    #[test]
    fn test_add_node() {
        let mut graphrecord = GraphRecord::new();

        assert_eq!(0, graphrecord.node_count());

        graphrecord.add_node("0".into(), HashMap::new()).unwrap();

        assert_eq!(1, graphrecord.node_count());

        graphrecord.freeze_schema().unwrap();

        graphrecord.add_node("1".into(), HashMap::new()).unwrap();

        assert_eq!(2, graphrecord.node_count());
    }

    #[test]
    fn test_invalid_add_node() {
        let mut graphrecord = create_graphrecord();

        assert!(
            graphrecord
                .add_node("0".into(), HashMap::new())
                .is_err_and(|e| matches!(e, GraphRecordError::NodeAlreadyExists { .. }))
        );

        graphrecord.freeze_schema().unwrap();

        assert!(
            graphrecord
                .add_node("4".into(), HashMap::from([("attribute".into(), 1.into())]))
                .is_err_and(|e| matches!(e, GraphRecordError::Schema(_)))
        );
    }

    #[test]
    fn test_remove_node() {
        let mut graphrecord = create_graphrecord();

        graphrecord
            .add_group("group".into(), Some(vec!["0".into()]), Some(vec![0]))
            .unwrap();

        let nodes = create_nodes();

        assert_eq!(4, graphrecord.node_count());
        assert_eq!(4, graphrecord.edge_count());
        assert_eq!(
            1,
            graphrecord
                .nodes_in_group(&("group".into()))
                .unwrap()
                .count()
        );
        assert_eq!(
            1,
            graphrecord
                .edges_in_group(&("group".into()))
                .unwrap()
                .count()
        );

        assert_eq!(nodes[0].1, graphrecord.remove_node(&"0".into()).unwrap());

        assert_eq!(3, graphrecord.node_count());
        assert_eq!(1, graphrecord.edge_count());
        assert_eq!(
            0,
            graphrecord
                .nodes_in_group(&("group".into()))
                .unwrap()
                .count()
        );
        assert_eq!(
            0,
            graphrecord
                .edges_in_group(&("group".into()))
                .unwrap()
                .count()
        );

        let mut graphrecord = GraphRecord::new();

        graphrecord.add_node(0.into(), HashMap::new()).unwrap();
        graphrecord
            .add_edge(0.into(), 0.into(), HashMap::new())
            .unwrap();

        assert_eq!(1, graphrecord.node_count());
        assert_eq!(1, graphrecord.edge_count());

        assert!(graphrecord.remove_node(&0.into()).is_ok());

        assert_eq!(0, graphrecord.node_count());
        assert_eq!(0, graphrecord.edge_count());
    }

    #[test]
    fn test_invalid_remove_node() {
        let mut graphrecord = create_graphrecord();

        // Removing a non-existing node should fail
        assert!(
            graphrecord
                .remove_node(&"50".into())
                .is_err_and(|e| matches!(e, GraphRecordError::NodeNotFound { .. }))
        );
    }

    #[test]
    fn test_add_nodes() {
        let mut graphrecord = GraphRecord::new();

        assert_eq!(0, graphrecord.node_count());

        let nodes = create_nodes();

        graphrecord.add_nodes(nodes).unwrap();

        assert_eq!(4, graphrecord.node_count());
    }

    #[test]
    fn test_invalid_add_nodes() {
        let mut graphrecord = create_graphrecord();

        let nodes = create_nodes();

        assert!(
            graphrecord
                .add_nodes(nodes)
                .is_err_and(|e| matches!(e, GraphRecordError::NodeAlreadyExists { .. }))
        );
    }

    #[test]
    fn test_add_nodes_dataframe() {
        let mut graphrecord = GraphRecord::new();

        assert_eq!(0, graphrecord.node_count());

        let nodes_dataframe = create_nodes_dataframe().unwrap();

        graphrecord
            .add_nodes_dataframes(vec![(nodes_dataframe, "index".to_string())])
            .unwrap();

        assert_eq!(2, graphrecord.node_count());
    }

    #[test]
    fn test_add_edge() {
        let mut graphrecord = create_graphrecord();

        assert_eq!(4, graphrecord.edge_count());

        graphrecord
            .add_edge("0".into(), "3".into(), HashMap::new())
            .unwrap();

        assert_eq!(5, graphrecord.edge_count());

        graphrecord.freeze_schema().unwrap();

        graphrecord
            .add_edge("0".into(), "3".into(), HashMap::new())
            .unwrap();

        assert_eq!(6, graphrecord.edge_count());
    }

    #[test]
    fn test_invalid_add_edge() {
        let mut graphrecord = GraphRecord::new();

        let nodes = create_nodes();

        graphrecord.add_nodes(nodes).unwrap();

        // Adding an edge pointing to a non-existing node should fail
        assert!(
            graphrecord
                .add_edge("0".into(), "50".into(), HashMap::new())
                .is_err_and(|e| matches!(e, GraphRecordError::NodeNotFound { .. }))
        );

        // Adding an edge from a non-existing node should fail
        assert!(
            graphrecord
                .add_edge("50".into(), "0".into(), HashMap::new())
                .is_err_and(|e| matches!(e, GraphRecordError::NodeNotFound { .. }))
        );

        graphrecord.freeze_schema().unwrap();

        assert!(
            graphrecord
                .add_edge(
                    "0".into(),
                    "3".into(),
                    HashMap::from([("attribute".into(), 1.into())])
                )
                .is_err_and(|e| matches!(e, GraphRecordError::Schema(_)))
        );
    }

    #[test]
    fn test_remove_edge() {
        let mut graphrecord = create_graphrecord();

        let edges = create_edges();

        assert_eq!(edges[0].2, graphrecord.remove_edge(&0).unwrap());
    }

    #[test]
    fn test_invalid_remove_edge() {
        let mut graphrecord = create_graphrecord();

        // Removing a non-existing edge should fail
        assert!(
            graphrecord
                .remove_edge(&50)
                .is_err_and(|e| matches!(e, GraphRecordError::EdgeNotFound { .. }))
        );
    }

    #[test]
    fn test_add_edges() {
        let mut graphrecord = GraphRecord::new();

        let nodes = create_nodes();

        graphrecord.add_nodes(nodes).unwrap();

        assert_eq!(0, graphrecord.edge_count());

        let edges = create_edges();

        graphrecord.add_edges(edges).unwrap();

        assert_eq!(4, graphrecord.edge_count());
    }

    #[test]
    fn test_add_edges_dataframe() {
        let mut graphrecord = GraphRecord::new();

        let nodes = create_nodes();

        graphrecord.add_nodes(nodes).unwrap();

        assert_eq!(0, graphrecord.edge_count());

        let edges = create_edges_dataframe().unwrap();

        graphrecord
            .add_edges_dataframes(vec![(edges, "from", "to")])
            .unwrap();

        assert_eq!(2, graphrecord.edge_count());
    }

    #[test]
    fn test_add_group() {
        let mut graphrecord = create_graphrecord();

        assert_eq!(0, graphrecord.group_count());

        graphrecord.add_group("0".into(), None, None).unwrap();

        assert_eq!(1, graphrecord.group_count());

        graphrecord
            .add_group("1".into(), Some(vec!["0".into(), "1".into()]), None)
            .unwrap();

        assert_eq!(2, graphrecord.group_count());

        assert_eq!(2, graphrecord.nodes_in_group(&"1".into()).unwrap().count());
    }

    #[test]
    fn test_invalid_add_group() {
        let mut graphrecord = create_graphrecord();

        // Adding a group with a non-existing node should fail
        assert!(
            graphrecord
                .add_group("0".into(), Some(vec!["50".into()]), None)
                .is_err_and(|e| matches!(e, GraphRecordError::NodeNotFound { .. }))
        );

        // Adding a group with a non-existing edge should fail
        assert!(
            graphrecord
                .add_group("0".into(), None, Some(vec![50]))
                .is_err_and(|e| matches!(e, GraphRecordError::EdgeNotFound { .. }))
        );

        graphrecord.add_group("0".into(), None, None).unwrap();

        // Adding an already existing group should fail
        assert!(
            graphrecord
                .add_group("0".into(), None, None)
                .is_err_and(|e| matches!(e, GraphRecordError::GroupAlreadyExists { .. }))
        );

        graphrecord.freeze_schema().unwrap();

        assert!(
            graphrecord
                .add_group("2".into(), None, None)
                .is_err_and(|e| matches!(
                    e,
                    GraphRecordError::Schema(SchemaError::GroupNotInSchema { .. })
                ))
        );

        graphrecord.remove_group(&"0".into()).unwrap();

        assert!(
            graphrecord
                .add_group("0".into(), Some(vec!["0".into()]), None)
                .is_err_and(|e| matches!(e, GraphRecordError::Schema(_)))
        );
        assert!(
            graphrecord
                .add_group("0".into(), None, Some(vec![0]))
                .is_err_and(|e| matches!(e, GraphRecordError::Schema(_)))
        );
    }

    #[test]
    fn test_remove_group() {
        let mut graphrecord = create_graphrecord();

        graphrecord.add_group("0".into(), None, None).unwrap();

        assert_eq!(1, graphrecord.group_count());

        graphrecord.remove_group(&"0".into()).unwrap();

        assert_eq!(0, graphrecord.group_count());
    }

    #[test]
    fn test_invalid_remove_group() {
        let mut graphrecord = GraphRecord::new();

        // Removing a non-existing group should fail
        assert!(
            graphrecord
                .remove_group(&"0".into())
                .is_err_and(|e| matches!(e, GraphRecordError::GroupNotFound { .. }))
        );
    }

    #[test]
    fn test_add_node_to_group() {
        let mut graphrecord = create_graphrecord();

        graphrecord
            .add_group("0".into(), Some(vec!["0".into(), "1".into()]), None)
            .unwrap();

        assert_eq!(2, graphrecord.nodes_in_group(&"0".into()).unwrap().count());

        graphrecord
            .add_node_to_group("0".into(), "2".into())
            .unwrap();

        assert_eq!(3, graphrecord.nodes_in_group(&"0".into()).unwrap().count());

        graphrecord
            .add_node("4".into(), HashMap::from([("test".into(), "test".into())]))
            .unwrap();

        graphrecord
            .add_group("1".into(), Some(vec!["4".into()]), None)
            .unwrap();

        graphrecord.freeze_schema().unwrap();

        graphrecord
            .add_node("5".into(), HashMap::from([("test".into(), "test".into())]))
            .unwrap();

        assert!(
            graphrecord
                .add_node_to_group("1".into(), "5".into())
                .is_ok()
        );

        assert_eq!(2, graphrecord.nodes_in_group(&"1".into()).unwrap().count());
    }

    #[test]
    fn test_invalid_add_node_to_group() {
        let mut graphrecord = create_graphrecord();

        graphrecord
            .add_group("0".into(), Some(vec!["0".into()]), None)
            .unwrap();

        // Adding a non-existing node to a group should fail
        assert!(
            graphrecord
                .add_node_to_group("0".into(), "50".into())
                .is_err_and(|e| matches!(e, GraphRecordError::NodeNotFound { .. }))
        );

        // Adding a node to a group that already is in the group should fail
        assert!(
            graphrecord
                .add_node_to_group("0".into(), "0".into())
                .is_err_and(|e| matches!(e, GraphRecordError::NodeAlreadyInGroup { .. }))
        );

        let mut graphrecord = GraphRecord::new();

        graphrecord
            .add_node("0".into(), HashMap::from([("test".into(), "test".into())]))
            .unwrap();
        graphrecord.add_group("group".into(), None, None).unwrap();

        graphrecord.freeze_schema().unwrap();

        assert!(
            graphrecord
                .add_node_to_group("group".into(), "0".into())
                .is_err_and(|e| matches!(e, GraphRecordError::Schema(_)))
        );
    }

    #[test]
    fn test_add_node_to_groups() {
        let mut graphrecord = create_graphrecord();

        graphrecord
            .add_group("0".into(), Some(vec!["0".into()]), None)
            .unwrap();
        graphrecord
            .add_group("1".into(), Some(vec!["1".into()]), None)
            .unwrap();

        graphrecord
            .add_node_to_groups(&["0".into(), "1".into()], "2".into())
            .unwrap();

        assert_eq!(2, graphrecord.nodes_in_group(&"0".into()).unwrap().count());
        assert_eq!(2, graphrecord.nodes_in_group(&"1".into()).unwrap().count());
    }

    #[test]
    fn test_invalid_add_node_to_groups() {
        let mut graphrecord = create_graphrecord();

        graphrecord
            .add_group("0".into(), Some(vec!["0".into()]), None)
            .unwrap();
        graphrecord
            .add_group("1".into(), Some(vec!["1".into()]), None)
            .unwrap();

        assert!(
            graphrecord
                .add_node_to_groups(&["0".into(), "1".into()], "50".into())
                .is_err_and(|e| matches!(e, GraphRecordError::NodeNotFound { .. }))
        );

        assert!(
            graphrecord
                .add_node_to_groups(&["0".into(), "1".into()], "0".into())
                .is_err_and(|e| matches!(e, GraphRecordError::NodeAlreadyInGroup { .. }))
        );

        let mut graphrecord = GraphRecord::new();

        graphrecord
            .add_node("0".into(), HashMap::from([("test".into(), "test".into())]))
            .unwrap();
        graphrecord.add_group("group".into(), None, None).unwrap();
        graphrecord.add_group("group2".into(), None, None).unwrap();

        graphrecord.freeze_schema().unwrap();

        assert!(
            graphrecord
                .add_node_to_groups(&["group".into(), "group2".into()], "0".into())
                .is_err_and(|e| matches!(e, GraphRecordError::Schema(_)))
        );
    }

    #[test]
    fn test_add_edge_to_group() {
        let mut graphrecord = create_graphrecord();

        graphrecord
            .add_group("0".into(), None, Some(vec![0, 1]))
            .unwrap();

        assert_eq!(2, graphrecord.edges_in_group(&"0".into()).unwrap().count());

        graphrecord.add_edge_to_group("0".into(), 2).unwrap();

        assert_eq!(3, graphrecord.edges_in_group(&"0".into()).unwrap().count());

        graphrecord
            .add_edge("0".into(), "1".into(), HashMap::new())
            .unwrap();

        graphrecord
            .add_group("1".into(), None, Some(vec![3]))
            .unwrap();

        graphrecord.freeze_schema().unwrap();

        let edge_index = graphrecord
            .add_edge("0".into(), "1".into(), HashMap::new())
            .unwrap();

        assert!(
            graphrecord
                .add_edge_to_group("1".into(), edge_index)
                .is_ok()
        );

        assert_eq!(2, graphrecord.edges_in_group(&"1".into()).unwrap().count());
    }

    #[test]
    fn test_invalid_add_edge_to_group() {
        let mut graphrecord = create_graphrecord();

        graphrecord
            .add_group("0".into(), None, Some(vec![0]))
            .unwrap();

        // Adding a non-existing edge to a group should fail
        assert!(
            graphrecord
                .add_edge_to_group("0".into(), 50)
                .is_err_and(|e| matches!(e, GraphRecordError::EdgeNotFound { .. }))
        );

        // Adding an edge to a group that already is in the group should fail
        assert!(
            graphrecord
                .add_edge_to_group("0".into(), 0)
                .is_err_and(|e| matches!(e, GraphRecordError::EdgeAlreadyInGroup { .. }))
        );

        let mut graphrecord = GraphRecord::new();

        graphrecord.add_node("0".into(), HashMap::new()).unwrap();
        graphrecord
            .add_edge(
                "0".into(),
                "0".into(),
                HashMap::from([("test".into(), "test".into())]),
            )
            .unwrap();
        graphrecord.add_group("group".into(), None, None).unwrap();

        graphrecord.freeze_schema().unwrap();

        assert!(
            graphrecord
                .add_edge_to_group("group".into(), 0)
                .is_err_and(|e| matches!(e, GraphRecordError::Schema(_)))
        );
    }

    #[test]
    fn test_add_edge_to_groups() {
        let mut graphrecord = create_graphrecord();

        graphrecord
            .add_group("0".into(), None, Some(vec![0]))
            .unwrap();
        graphrecord
            .add_group("1".into(), None, Some(vec![1]))
            .unwrap();

        graphrecord
            .add_edge_to_groups(&["0".into(), "1".into()], 2)
            .unwrap();

        assert_eq!(2, graphrecord.edges_in_group(&"0".into()).unwrap().count());
        assert_eq!(2, graphrecord.edges_in_group(&"1".into()).unwrap().count());
    }

    #[test]
    fn test_invalid_add_edge_to_groups() {
        let mut graphrecord = create_graphrecord();

        graphrecord
            .add_group("0".into(), None, Some(vec![0]))
            .unwrap();
        graphrecord
            .add_group("1".into(), None, Some(vec![1]))
            .unwrap();

        assert!(
            graphrecord
                .add_edge_to_groups(&["0".into(), "1".into()], 50)
                .is_err_and(|e| matches!(e, GraphRecordError::EdgeNotFound { .. }))
        );

        assert!(
            graphrecord
                .add_edge_to_groups(&["0".into(), "1".into()], 0)
                .is_err_and(|e| matches!(e, GraphRecordError::EdgeAlreadyInGroup { .. }))
        );

        let mut graphrecord = GraphRecord::new();

        graphrecord.add_node("0".into(), HashMap::new()).unwrap();
        graphrecord
            .add_edge(
                "0".into(),
                "0".into(),
                HashMap::from([("test".into(), "test".into())]),
            )
            .unwrap();
        graphrecord.add_group("group".into(), None, None).unwrap();
        graphrecord.add_group("group2".into(), None, None).unwrap();

        graphrecord.freeze_schema().unwrap();

        assert!(
            graphrecord
                .add_edge_to_groups(&["group".into(), "group2".into()], 0)
                .is_err_and(|e| matches!(e, GraphRecordError::Schema(_)))
        );
    }

    #[test]
    fn test_remove_node_from_group() {
        let mut graphrecord = create_graphrecord();

        graphrecord
            .add_group("0".into(), Some(vec!["0".into(), "1".into()]), None)
            .unwrap();

        assert_eq!(2, graphrecord.nodes_in_group(&"0".into()).unwrap().count());

        graphrecord
            .remove_node_from_group(&"0".into(), &"0".into())
            .unwrap();

        assert_eq!(1, graphrecord.nodes_in_group(&"0".into()).unwrap().count());
    }

    #[test]
    fn test_invalid_remove_node_from_group() {
        let mut graphrecord = create_graphrecord();

        graphrecord
            .add_group("0".into(), Some(vec!["0".into()]), None)
            .unwrap();

        // Removing a node from a non-existing group should fail
        assert!(
            graphrecord
                .remove_node_from_group(&"50".into(), &"0".into())
                .is_err_and(|e| matches!(e, GraphRecordError::GroupNotFound { .. }))
        );

        // Removing a non-existing node from a group should fail
        assert!(
            graphrecord
                .remove_node_from_group(&"0".into(), &"50".into())
                .is_err_and(|e| matches!(e, GraphRecordError::NodeNotFound { .. }))
        );

        // Removing a node from a group it is not in should fail
        assert!(
            graphrecord
                .remove_node_from_group(&"0".into(), &"1".into())
                .is_err_and(|e| matches!(e, GraphRecordError::NodeNotInGroup { .. }))
        );
    }

    #[test]
    fn test_remove_node_from_groups() {
        let mut graphrecord = create_graphrecord();

        graphrecord
            .add_group("0".into(), Some(vec!["0".into(), "1".into()]), None)
            .unwrap();
        graphrecord
            .add_group("1".into(), Some(vec!["0".into(), "2".into()]), None)
            .unwrap();

        graphrecord
            .remove_node_from_groups(&["0".into(), "1".into()], &"0".into())
            .unwrap();

        assert_eq!(1, graphrecord.nodes_in_group(&"0".into()).unwrap().count());
        assert_eq!(1, graphrecord.nodes_in_group(&"1".into()).unwrap().count());
    }

    #[test]
    fn test_invalid_remove_node_from_groups() {
        let mut graphrecord = create_graphrecord();

        graphrecord
            .add_group("0".into(), Some(vec!["0".into()]), None)
            .unwrap();
        graphrecord
            .add_group("1".into(), Some(vec!["1".into()]), None)
            .unwrap();

        assert!(
            graphrecord
                .remove_node_from_groups(&["0".into(), "1".into()], &"50".into())
                .is_err_and(|e| matches!(e, GraphRecordError::NodeNotFound { .. }))
        );

        assert!(
            graphrecord
                .remove_node_from_groups(&["0".into(), "1".into()], &"1".into())
                .is_err_and(|e| matches!(e, GraphRecordError::NodeNotInGroup { .. }))
        );
    }

    #[test]
    fn test_remove_edge_from_group() {
        let mut graphrecord = create_graphrecord();

        graphrecord
            .add_group("0".into(), None, Some(vec![0, 1]))
            .unwrap();

        assert_eq!(2, graphrecord.edges_in_group(&"0".into()).unwrap().count());

        graphrecord.remove_edge_from_group(&"0".into(), &0).unwrap();

        assert_eq!(1, graphrecord.edges_in_group(&"0".into()).unwrap().count());
    }

    #[test]
    fn test_invalid_remove_edge_from_group() {
        let mut graphrecord = create_graphrecord();

        graphrecord
            .add_group("0".into(), None, Some(vec![0]))
            .unwrap();

        // Removing an edge from a non-existing group should fail
        assert!(
            graphrecord
                .remove_edge_from_group(&"50".into(), &0)
                .is_err_and(|e| matches!(e, GraphRecordError::GroupNotFound { .. }))
        );

        // Removing a non-existing edge from a group should fail
        assert!(
            graphrecord
                .remove_edge_from_group(&"0".into(), &50)
                .is_err_and(|e| matches!(e, GraphRecordError::EdgeNotFound { .. }))
        );

        // Removing an edge from a group it is not in should fail
        assert!(
            graphrecord
                .remove_edge_from_group(&"0".into(), &1)
                .is_err_and(|e| matches!(e, GraphRecordError::EdgeNotInGroup { .. }))
        );
    }

    #[test]
    fn test_remove_edge_from_groups() {
        let mut graphrecord = create_graphrecord();

        graphrecord
            .add_group("0".into(), None, Some(vec![0, 1]))
            .unwrap();
        graphrecord
            .add_group("1".into(), None, Some(vec![0, 2]))
            .unwrap();

        graphrecord
            .remove_edge_from_groups(&["0".into(), "1".into()], &0)
            .unwrap();

        assert_eq!(1, graphrecord.edges_in_group(&"0".into()).unwrap().count());
        assert_eq!(1, graphrecord.edges_in_group(&"1".into()).unwrap().count());
    }

    #[test]
    fn test_invalid_remove_edge_from_groups() {
        let mut graphrecord = create_graphrecord();

        graphrecord
            .add_group("0".into(), None, Some(vec![0]))
            .unwrap();
        graphrecord
            .add_group("1".into(), None, Some(vec![1]))
            .unwrap();

        assert!(
            graphrecord
                .remove_edge_from_groups(&["0".into(), "1".into()], &50)
                .is_err_and(|e| matches!(e, GraphRecordError::EdgeNotFound { .. }))
        );

        assert!(
            graphrecord
                .remove_edge_from_groups(&["0".into(), "1".into()], &1)
                .is_err_and(|e| matches!(e, GraphRecordError::EdgeNotInGroup { .. }))
        );
    }

    #[test]
    fn test_add_nodes_to_groups() {
        let mut graphrecord = create_graphrecord();

        graphrecord
            .add_group("0".into(), Some(vec!["0".into()]), None)
            .unwrap();
        graphrecord
            .add_group("1".into(), Some(vec!["1".into()]), None)
            .unwrap();

        graphrecord
            .add_nodes_to_groups(&["0".into(), "1".into()], vec!["2".into(), "3".into()])
            .unwrap();

        assert_eq!(3, graphrecord.nodes_in_group(&"0".into()).unwrap().count());
        assert_eq!(3, graphrecord.nodes_in_group(&"1".into()).unwrap().count());
    }

    #[test]
    fn test_invalid_add_nodes_to_groups() {
        let mut graphrecord = create_graphrecord();

        graphrecord
            .add_group("0".into(), Some(vec!["0".into()]), None)
            .unwrap();
        graphrecord
            .add_group("1".into(), Some(vec!["1".into()]), None)
            .unwrap();

        assert!(
            graphrecord
                .add_nodes_to_groups(&["0".into(), "1".into()], vec!["50".into()],)
                .is_err_and(|e| matches!(e, GraphRecordError::NodeNotFound { .. }))
        );

        assert!(
            graphrecord
                .add_nodes_to_groups(&["0".into(), "1".into()], vec!["0".into()],)
                .is_err_and(|e| matches!(e, GraphRecordError::NodeAlreadyInGroup { .. }))
        );

        let mut graphrecord = GraphRecord::new();

        graphrecord
            .add_node("0".into(), HashMap::from([("test".into(), "test".into())]))
            .unwrap();
        graphrecord.add_group("group".into(), None, None).unwrap();
        graphrecord.add_group("group2".into(), None, None).unwrap();

        graphrecord.freeze_schema().unwrap();

        assert!(
            graphrecord
                .add_nodes_to_groups(&["group".into(), "group2".into()], vec!["0".into()],)
                .is_err_and(|e| matches!(e, GraphRecordError::Schema(_)))
        );
    }

    #[test]
    fn test_add_edges_to_groups() {
        let mut graphrecord = create_graphrecord();

        graphrecord
            .add_group("0".into(), None, Some(vec![0]))
            .unwrap();
        graphrecord
            .add_group("1".into(), None, Some(vec![1]))
            .unwrap();

        graphrecord
            .add_edges_to_groups(&["0".into(), "1".into()], vec![2, 3])
            .unwrap();

        assert_eq!(3, graphrecord.edges_in_group(&"0".into()).unwrap().count());
        assert_eq!(3, graphrecord.edges_in_group(&"1".into()).unwrap().count());
    }

    #[test]
    fn test_invalid_add_edges_to_groups() {
        let mut graphrecord = create_graphrecord();

        graphrecord
            .add_group("0".into(), None, Some(vec![0]))
            .unwrap();
        graphrecord
            .add_group("1".into(), None, Some(vec![1]))
            .unwrap();

        assert!(
            graphrecord
                .add_edges_to_groups(&["0".into(), "1".into()], vec![50])
                .is_err_and(|e| matches!(e, GraphRecordError::EdgeNotFound { .. }))
        );

        assert!(
            graphrecord
                .add_edges_to_groups(&["0".into(), "1".into()], vec![0])
                .is_err_and(|e| matches!(e, GraphRecordError::EdgeAlreadyInGroup { .. }))
        );

        let mut graphrecord = GraphRecord::new();

        graphrecord.add_node("0".into(), HashMap::new()).unwrap();
        graphrecord
            .add_edge(
                "0".into(),
                "0".into(),
                HashMap::from([("test".into(), "test".into())]),
            )
            .unwrap();
        graphrecord.add_group("group".into(), None, None).unwrap();
        graphrecord.add_group("group2".into(), None, None).unwrap();

        graphrecord.freeze_schema().unwrap();

        assert!(
            graphrecord
                .add_edges_to_groups(&["group".into(), "group2".into()], vec![0])
                .is_err_and(|e| matches!(e, GraphRecordError::Schema(_)))
        );
    }

    #[test]
    fn test_remove_nodes_from_groups() {
        let mut graphrecord = create_graphrecord();

        graphrecord
            .add_group(
                "0".into(),
                Some(vec!["0".into(), "1".into(), "2".into()]),
                None,
            )
            .unwrap();
        graphrecord
            .add_group(
                "1".into(),
                Some(vec!["0".into(), "1".into(), "2".into()]),
                None,
            )
            .unwrap();

        graphrecord
            .remove_nodes_from_groups(&["0".into(), "1".into()], &["0".into(), "1".into()])
            .unwrap();

        assert_eq!(1, graphrecord.nodes_in_group(&"0".into()).unwrap().count());
        assert_eq!(1, graphrecord.nodes_in_group(&"1".into()).unwrap().count());
    }

    #[test]
    fn test_invalid_remove_nodes_from_groups() {
        let mut graphrecord = create_graphrecord();

        graphrecord
            .add_group("0".into(), Some(vec!["0".into()]), None)
            .unwrap();
        graphrecord
            .add_group("1".into(), Some(vec!["1".into()]), None)
            .unwrap();

        assert!(
            graphrecord
                .remove_nodes_from_groups(&["0".into(), "1".into()], &["50".into()],)
                .is_err_and(|e| matches!(e, GraphRecordError::NodeNotFound { .. }))
        );

        assert!(
            graphrecord
                .remove_nodes_from_groups(&["0".into(), "1".into()], &["1".into()],)
                .is_err_and(|e| matches!(e, GraphRecordError::NodeNotInGroup { .. }))
        );
    }

    #[test]
    fn test_remove_edges_from_groups() {
        let mut graphrecord = create_graphrecord();

        graphrecord
            .add_group("0".into(), None, Some(vec![0, 1, 2]))
            .unwrap();
        graphrecord
            .add_group("1".into(), None, Some(vec![0, 1, 2]))
            .unwrap();

        graphrecord
            .remove_edges_from_groups(&["0".into(), "1".into()], &[0, 1])
            .unwrap();

        assert_eq!(1, graphrecord.edges_in_group(&"0".into()).unwrap().count());
        assert_eq!(1, graphrecord.edges_in_group(&"1".into()).unwrap().count());
    }

    #[test]
    fn test_invalid_remove_edges_from_groups() {
        let mut graphrecord = create_graphrecord();

        graphrecord
            .add_group("0".into(), None, Some(vec![0]))
            .unwrap();
        graphrecord
            .add_group("1".into(), None, Some(vec![1]))
            .unwrap();

        assert!(
            graphrecord
                .remove_edges_from_groups(&["0".into(), "1".into()], &[50])
                .is_err_and(|e| matches!(e, GraphRecordError::EdgeNotFound { .. }))
        );

        assert!(
            graphrecord
                .remove_edges_from_groups(&["0".into(), "1".into()], &[1])
                .is_err_and(|e| matches!(e, GraphRecordError::EdgeNotInGroup { .. }))
        );
    }

    #[test]
    fn test_add_node_with_groups() {
        let mut graphrecord = create_graphrecord();

        graphrecord.add_group("0".into(), None, None).unwrap();
        graphrecord.add_group("1".into(), None, None).unwrap();

        graphrecord
            .add_node_with_groups(
                "4".into(),
                HashMap::from([("lorem".into(), "ipsum".into())]),
                &["0".into(), "1".into()],
            )
            .unwrap();

        assert_eq!(5, graphrecord.node_count());
        assert_eq!(1, graphrecord.nodes_in_group(&"0".into()).unwrap().count());
        assert_eq!(1, graphrecord.nodes_in_group(&"1".into()).unwrap().count());
    }

    #[test]
    fn test_invalid_add_node_with_groups() {
        let mut graphrecord = create_graphrecord();

        graphrecord.add_group("0".into(), None, None).unwrap();
        graphrecord.add_group("1".into(), None, None).unwrap();

        assert!(
            graphrecord
                .add_node_with_groups("0".into(), HashMap::new(), &["0".into(), "1".into()],)
                .is_err_and(|e| matches!(e, GraphRecordError::NodeAlreadyExists { .. }))
        );
    }

    #[test]
    fn test_add_edge_with_groups() {
        let mut graphrecord = create_graphrecord();

        graphrecord.add_group("0".into(), None, None).unwrap();
        graphrecord.add_group("1".into(), None, None).unwrap();

        let edge_index = graphrecord
            .add_edge_with_groups(
                "0".into(),
                "1".into(),
                HashMap::from([("sed".into(), "do".into())]),
                &["0".into(), "1".into()],
            )
            .unwrap();

        assert_eq!(5, graphrecord.edge_count());
        assert_eq!(4, edge_index);
        assert_eq!(1, graphrecord.edges_in_group(&"0".into()).unwrap().count());
        assert_eq!(1, graphrecord.edges_in_group(&"1".into()).unwrap().count());
    }

    #[test]
    fn test_invalid_add_edge_with_groups() {
        let mut graphrecord = create_graphrecord();

        graphrecord.add_group("0".into(), None, None).unwrap();
        graphrecord.add_group("1".into(), None, None).unwrap();

        assert!(
            graphrecord
                .add_edge_with_groups(
                    "50".into(),
                    "0".into(),
                    HashMap::new(),
                    &["0".into(), "1".into()],
                )
                .is_err_and(|e| matches!(e, GraphRecordError::NodeNotFound { .. }))
        );

        assert!(
            graphrecord
                .add_edge_with_groups(
                    "0".into(),
                    "50".into(),
                    HashMap::new(),
                    &["0".into(), "1".into()],
                )
                .is_err_and(|e| matches!(e, GraphRecordError::NodeNotFound { .. }))
        );
    }

    #[test]
    fn test_add_nodes_with_groups() {
        let mut graphrecord = GraphRecord::new();

        graphrecord.add_group("0".into(), None, None).unwrap();
        graphrecord.add_group("1".into(), None, None).unwrap();

        graphrecord
            .add_nodes_with_groups(
                vec![
                    (
                        "0".into(),
                        HashMap::from([("lorem".into(), "ipsum".into())]),
                    ),
                    (
                        "1".into(),
                        HashMap::from([("amet".into(), "consectetur".into())]),
                    ),
                ],
                &["0".into(), "1".into()],
            )
            .unwrap();

        assert_eq!(2, graphrecord.node_count());
        assert_eq!(2, graphrecord.nodes_in_group(&"0".into()).unwrap().count());
        assert_eq!(2, graphrecord.nodes_in_group(&"1".into()).unwrap().count());
    }

    #[test]
    fn test_invalid_add_nodes_with_groups() {
        let mut graphrecord = create_graphrecord();

        graphrecord.add_group("0".into(), None, None).unwrap();
        graphrecord.add_group("1".into(), None, None).unwrap();

        assert!(
            graphrecord
                .add_nodes_with_groups(
                    vec![("0".into(), HashMap::new())],
                    &["0".into(), "1".into()],
                )
                .is_err_and(|e| matches!(e, GraphRecordError::NodeAlreadyExists { .. }))
        );
    }

    #[test]
    fn test_add_edges_with_groups() {
        let mut graphrecord = create_graphrecord();

        graphrecord.add_group("0".into(), None, None).unwrap();
        graphrecord.add_group("1".into(), None, None).unwrap();

        let edge_indices = graphrecord
            .add_edges_with_groups(
                vec![
                    (
                        "0".into(),
                        "1".into(),
                        HashMap::from([("sed".into(), "do".into())]),
                    ),
                    (
                        "1".into(),
                        "0".into(),
                        HashMap::from([("sed".into(), "do".into())]),
                    ),
                ],
                &["0".into(), "1".into()],
            )
            .unwrap();

        assert_eq!(6, graphrecord.edge_count());
        assert_eq!(vec![4, 5], edge_indices);
        assert_eq!(2, graphrecord.edges_in_group(&"0".into()).unwrap().count());
        assert_eq!(2, graphrecord.edges_in_group(&"1".into()).unwrap().count());
    }

    #[test]
    fn test_invalid_add_edges_with_groups() {
        let mut graphrecord = create_graphrecord();

        graphrecord.add_group("0".into(), None, None).unwrap();
        graphrecord.add_group("1".into(), None, None).unwrap();

        assert!(
            graphrecord
                .add_edges_with_groups(
                    vec![("50".into(), "0".into(), HashMap::new())],
                    &["0".into(), "1".into()],
                )
                .is_err_and(|e| matches!(e, GraphRecordError::NodeNotFound { .. }))
        );

        assert!(
            graphrecord
                .add_edges_with_groups(
                    vec![("0".into(), "50".into(), HashMap::new())],
                    &["0".into(), "1".into()],
                )
                .is_err_and(|e| matches!(e, GraphRecordError::NodeNotFound { .. }))
        );
    }

    #[test]
    fn test_add_nodes_dataframes_with_groups() {
        let mut graphrecord = GraphRecord::new();

        graphrecord.add_group("0".into(), None, None).unwrap();
        graphrecord.add_group("1".into(), None, None).unwrap();

        let nodes_dataframe = create_nodes_dataframe().unwrap();

        graphrecord
            .add_nodes_dataframes_with_groups(
                vec![NodeDataFrameInput {
                    dataframe: nodes_dataframe,
                    index_column: "index".to_string(),
                }],
                &["0".into(), "1".into()],
            )
            .unwrap();

        assert_eq!(2, graphrecord.node_count());
        assert_eq!(2, graphrecord.nodes_in_group(&"0".into()).unwrap().count());
        assert_eq!(2, graphrecord.nodes_in_group(&"1".into()).unwrap().count());
    }

    #[test]
    fn test_add_edges_dataframes_with_groups() {
        let mut graphrecord = GraphRecord::new();

        let nodes = create_nodes();

        graphrecord.add_nodes(nodes).unwrap();

        graphrecord.add_group("0".into(), None, None).unwrap();
        graphrecord.add_group("1".into(), None, None).unwrap();

        let edges_dataframe = create_edges_dataframe().unwrap();

        let edge_indices = graphrecord
            .add_edges_dataframes_with_groups(
                vec![EdgeDataFrameInput {
                    dataframe: edges_dataframe,
                    source_index_column: "from".to_string(),
                    target_index_column: "to".to_string(),
                }],
                &["0".into(), "1".into()],
            )
            .unwrap();

        assert_eq!(2, graphrecord.edge_count());
        assert_eq!(2, edge_indices.len());
        assert_eq!(2, graphrecord.edges_in_group(&"0".into()).unwrap().count());
        assert_eq!(2, graphrecord.edges_in_group(&"1".into()).unwrap().count());
    }

    #[test]
    fn test_groups() {
        let mut graphrecord = create_graphrecord();

        graphrecord.add_group("0".into(), None, None).unwrap();

        let groups: Vec<_> = graphrecord.groups().collect();

        assert_eq!(vec![&(GraphRecordAttribute::from("0"))], groups);
    }

    #[test]
    fn test_nodes_in_group() {
        let mut graphrecord = create_graphrecord();

        graphrecord.add_group("0".into(), None, None).unwrap();

        assert_eq!(0, graphrecord.nodes_in_group(&"0".into()).unwrap().count());

        graphrecord
            .add_group("1".into(), Some(vec!["0".into()]), None)
            .unwrap();

        assert_eq!(1, graphrecord.nodes_in_group(&"1".into()).unwrap().count());
    }

    #[test]
    fn test_invalid_nodes_in_group() {
        let graphrecord = create_graphrecord();

        // Querying a non-existing group should fail
        assert!(
            graphrecord
                .nodes_in_group(&"0".into())
                .is_err_and(|e| matches!(e, GraphRecordError::GroupNotFound { .. }))
        );
    }

    #[test]
    fn test_edges_in_group() {
        let mut graphrecord = create_graphrecord();

        graphrecord.add_group("0".into(), None, None).unwrap();

        assert_eq!(0, graphrecord.edges_in_group(&"0".into()).unwrap().count());

        graphrecord
            .add_group("1".into(), None, Some(vec![0]))
            .unwrap();

        assert_eq!(1, graphrecord.edges_in_group(&"1".into()).unwrap().count());
    }

    #[test]
    fn test_invalid_edges_in_group() {
        let graphrecord = create_graphrecord();

        // Querying a non-existing group should fail
        assert!(
            graphrecord
                .edges_in_group(&"0".into())
                .is_err_and(|e| matches!(e, GraphRecordError::GroupNotFound { .. }))
        );
    }

    #[test]
    fn test_groups_of_node() {
        let mut graphrecord = create_graphrecord();

        graphrecord
            .add_group("0".into(), Some(vec!["0".into()]), None)
            .unwrap();

        assert_eq!(1, graphrecord.groups_of_node(&"0".into()).unwrap().count());
    }

    #[test]
    fn test_invalid_groups_of_node() {
        let graphrecord = create_graphrecord();

        // Querying the groups of a non-existing node should fail
        assert!(
            graphrecord
                .groups_of_node(&"50".into())
                .is_err_and(|e| matches!(e, GraphRecordError::NodeNotFound { .. }))
        );
    }

    #[test]
    fn test_groups_of_edge() {
        let mut graphrecord = create_graphrecord();

        graphrecord
            .add_group("0".into(), None, Some(vec![0]))
            .unwrap();

        assert_eq!(1, graphrecord.groups_of_edge(&0).unwrap().count());
    }

    #[test]
    fn test_invalid_groups_of_edge() {
        let graphrecord = create_graphrecord();

        // Querying the groups of a non-existing edge should fail
        assert!(
            graphrecord
                .groups_of_edge(&50)
                .is_err_and(|e| matches!(e, GraphRecordError::EdgeNotFound { .. }))
        );
    }

    #[test]
    fn test_node_count() {
        let mut graphrecord = GraphRecord::new();

        assert_eq!(0, graphrecord.node_count());

        graphrecord.add_node("0".into(), HashMap::new()).unwrap();

        assert_eq!(1, graphrecord.node_count());
    }

    #[test]
    fn test_edge_count() {
        let mut graphrecord = GraphRecord::new();

        graphrecord.add_node("0".into(), HashMap::new()).unwrap();
        graphrecord.add_node("1".into(), HashMap::new()).unwrap();

        assert_eq!(0, graphrecord.edge_count());

        graphrecord
            .add_edge("0".into(), "1".into(), HashMap::new())
            .unwrap();

        assert_eq!(1, graphrecord.edge_count());
    }

    #[test]
    fn test_group_count() {
        let mut graphrecord = create_graphrecord();

        assert_eq!(0, graphrecord.group_count());

        graphrecord.add_group("0".into(), None, None).unwrap();

        assert_eq!(1, graphrecord.group_count());
    }

    #[test]
    fn test_contains_node() {
        let graphrecord = create_graphrecord();

        assert!(graphrecord.contains_node(&"0".into()));

        assert!(!graphrecord.contains_node(&"50".into()));
    }

    #[test]
    fn test_contains_edge() {
        let graphrecord = create_graphrecord();

        assert!(graphrecord.contains_edge(&0));

        assert!(!graphrecord.contains_edge(&50));
    }

    #[test]
    fn test_contains_group() {
        let mut graphrecord = create_graphrecord();

        assert!(!graphrecord.contains_group(&"0".into()));

        graphrecord.add_group("0".into(), None, None).unwrap();

        assert!(graphrecord.contains_group(&"0".into()));
    }

    #[test]
    fn test_outgoing_neighbors() {
        let graphrecord = create_graphrecord();

        let neighbors = graphrecord.outgoing_neighbors(&"0".into()).unwrap();

        assert_eq!(2, neighbors.count());
    }

    #[test]
    fn test_invalid_outgoing_neighbors() {
        let graphrecord = GraphRecord::new();

        // Querying neighbors of a non-existing node should fail
        assert!(
            graphrecord
                .outgoing_neighbors(&"0".into())
                .is_err_and(|e| matches!(e, GraphRecordError::NodeNotFound { .. }))
        );
    }

    #[test]
    fn test_neighbors() {
        let graphrecord = create_graphrecord();

        let neighbors = graphrecord.outgoing_neighbors(&"2".into()).unwrap();
        assert_eq!(0, neighbors.count());

        let neighbors = graphrecord.neighbors(&"2".into()).unwrap();
        assert_eq!(2, neighbors.count());
    }

    #[test]
    fn test_invalid_neighbors() {
        let graphrecord = create_graphrecord();

        assert!(
            graphrecord
                .neighbors(&"50".into())
                .is_err_and(|e| matches!(e, GraphRecordError::NodeNotFound { .. }))
        );
    }

    #[test]
    fn test_clear() {
        let mut graphrecord = create_graphrecord();

        graphrecord.clear().unwrap();

        assert_eq!(0, graphrecord.node_count());
        assert_eq!(0, graphrecord.edge_count());
        assert_eq!(0, graphrecord.group_count());
    }
}