open-hypergraphs 0.3.1

use crate::array::vec::{VecArray, VecKind};
use crate::finite_function::*;

use core::fmt::Debug;

#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
#[cfg_attr(feature = "serde", derive(serde::Serialize, serde::Deserialize))]
pub struct NodeId(pub usize);

#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
#[cfg_attr(feature = "serde", derive(serde::Serialize, serde::Deserialize))]
pub struct EdgeId(pub usize);

#[derive(Debug, Clone, PartialEq)]
#[cfg_attr(feature = "serde", derive(serde::Serialize, serde::Deserialize))]
pub struct Hyperedge {
    pub sources: Vec<NodeId>,
    pub targets: Vec<NodeId>,
}

/// Create a [`Hyperedge`] from a tuple of `(sources, targets)`.
///
/// This allows convenient creation of hyperedges from various collection types:
/// ```
/// # use open_hypergraphs::lax::{Hyperedge, NodeId};
/// let edge: Hyperedge = (vec![NodeId(0), NodeId(1)], vec![NodeId(2)]).into();
/// let edge: Hyperedge = ([NodeId(0), NodeId(1)], [NodeId(2)]).into();
/// ```
impl<S, T> From<(S, T)> for Hyperedge
where
    S: Into<Vec<NodeId>>,
    T: Into<Vec<NodeId>>,
{
    fn from((sources, targets): (S, T)) -> Self {
        Hyperedge {
            sources: sources.into(),
            targets: targets.into(),
        }
    }
}

pub type Interface = (Vec<NodeId>, Vec<NodeId>);

/// A [`crate::lax::Hypergraph`] represents an "un-quotiented" hypergraph.
///
/// It can be thought of as a collection of disconnected operations and wires along with a
/// *quotient map* which can be used with connected components to produce a `Hypergraph`.
#[derive(Debug, Clone, PartialEq)]
#[cfg_attr(feature = "serde", derive(serde::Serialize, serde::Deserialize))]
#[cfg_attr(
    feature = "serde",
    serde(
        bound = "O: serde::Serialize + serde::de::DeserializeOwned, A: serde::Serialize + serde::de::DeserializeOwned"
    )
)]
pub struct Hypergraph<O, A> {
    /// Node labels. Defines a finite map from [`NodeId`] to node label
    pub nodes: Vec<O>,

    /// Edge labels. Defines a finite map from [`EdgeId`] to edge label
    pub edges: Vec<A>,

    /// Hyperedges map an *ordered list* of source nodes to an ordered list of target nodes.
    pub adjacency: Vec<Hyperedge>,

    // A finite endofunction on the set of nodes, identifying nodes to be quotiented.
    // NOTE: this is a *graph* on the set of nodes.
    pub quotient: (Vec<NodeId>, Vec<NodeId>),
}

impl<O, A> Hypergraph<O, A> {
    /// The empty Hypergraph with no nodes or edges.
    pub fn empty() -> Self {
        Hypergraph {
            nodes: vec![],
            edges: vec![],
            adjacency: vec![],
            quotient: (vec![], vec![]),
        }
    }

    /// Check if the quotient map is empty: if so, then this is already a strict OpenHypergraph
    pub fn is_strict(&self) -> bool {
        self.quotient.0.is_empty()
    }

    pub fn from_strict(h: crate::strict::hypergraph::Hypergraph<VecKind, O, A>) -> Self {
        let mut adjacency = Vec::with_capacity(h.x.0.len());
        for (sources, targets) in h.s.into_iter().zip(h.t.into_iter()) {
            adjacency.push(Hyperedge {
                sources: sources.table.iter().map(|i| NodeId(*i)).collect(),
                targets: targets.table.iter().map(|i| NodeId(*i)).collect(),
            })
        }

        Hypergraph {
            nodes: h.w.0 .0,
            edges: h.x.0 .0,
            adjacency,
            quotient: (vec![], vec![]),
        }
    }

    pub fn discrete(nodes: Vec<O>) -> Self {
        let mut h = Self::empty();
        h.nodes = nodes;
        h
    }

    /// Add a single node labeled `w` to the [`Hypergraph`]
    pub fn new_node(&mut self, w: O) -> NodeId {
        let index = self.nodes.len();
        self.nodes.push(w);
        NodeId(index)
    }

    /// Add a single hyperedge labeled `a` to the [`Hypergraph`]
    /// it has sources and targets specified by `interface`
    /// return which `EdgeId` corresponds to that new hyperedge
    pub fn new_edge(&mut self, x: A, interface: impl Into<Hyperedge>) -> EdgeId {
        let edge_idx = self.edges.len();
        self.edges.push(x);
        self.adjacency.push(interface.into());
        EdgeId(edge_idx)
    }

    /// Append a "singleton" operation to the Hypergraph.
    ///
    /// 1. For each element t of `source_type` (resp. `target_type`), creates a node labeled t
    /// 2. creates An edge labeled `x`, and sets its source/target nodes to those from step (1)
    ///
    /// Returns the index [`EdgeId`] of the operation in the [`Hypergraph`], and its source and
    /// target nodes.
    pub fn new_operation(
        &mut self,
        x: A,
        source_type: Vec<O>,
        target_type: Vec<O>,
    ) -> (EdgeId, Interface) {
        let sources: Vec<NodeId> = source_type.into_iter().map(|t| self.new_node(t)).collect();
        let targets: Vec<NodeId> = target_type.into_iter().map(|t| self.new_node(t)).collect();
        let interface = (sources.clone(), targets.clone());
        let edge_id = self.new_edge(x, Hyperedge { sources, targets });
        (edge_id, interface)
    }

    /// Identify a pair of nodes `(v, w)` by adding them to the quotient map.
    ///
    /// Note that if the labels of `v` and `w` are not equal, then this will not represent a valid
    /// `Hypergraph`.
    /// This is intentional so that typechecking and type inference can be deferred until after
    /// construction of the `Hypergraph`.
    pub fn unify(&mut self, v: NodeId, w: NodeId) {
        // add nodes to the quotient graph
        self.quotient.0.push(v);
        self.quotient.1.push(w);
    }

    /// Add a new *source* node labeled `w` to edge `edge_id`.
    pub fn add_edge_source(&mut self, edge_id: EdgeId, w: O) -> NodeId {
        let node_id = self.new_node(w);
        self.adjacency[edge_id.0].sources.push(node_id);
        node_id
    }

    /// Add a new *target* node labeled `w` to edge `edge_id`
    pub fn add_edge_target(&mut self, edge_id: EdgeId, w: O) -> NodeId {
        let node_id = self.new_node(w);
        self.adjacency[edge_id.0].targets.push(node_id);
        node_id
    }

    /// Set the nodes of a Hypergraph, possibly changing types.
    /// Returns None if new nodes array had different length.
    pub fn with_nodes<T, F: FnOnce(Vec<O>) -> Vec<T>>(self, f: F) -> Option<Hypergraph<T, A>> {
        let n = self.nodes.len();
        let nodes = f(self.nodes);
        if nodes.len() != n {
            return None;
        }

        Some(Hypergraph {
            nodes,
            edges: self.edges,
            adjacency: self.adjacency,
            quotient: self.quotient,
        })
    }

    /// Map the node labels of this Hypergraph, possibly changing their type
    pub fn map_nodes<F: Fn(O) -> T, T>(self, f: F) -> Hypergraph<T, A> {
        // note: unwrap is safe because length is preserved
        self.with_nodes(|nodes| nodes.into_iter().map(f).collect())
            .unwrap()
    }

    /// Set the edges of a Hypergraph, possibly changing types.
    /// Returns None if new edges array had different length.
    pub fn with_edges<T, F: FnOnce(Vec<A>) -> Vec<T>>(self, f: F) -> Option<Hypergraph<O, T>> {
        let n = self.edges.len();
        let edges = f(self.edges);
        if edges.len() != n {
            return None;
        }

        Some(Hypergraph {
            nodes: self.nodes,
            edges,
            adjacency: self.adjacency,
            quotient: self.quotient,
        })
    }

    /// Map the edge labels of this Hypergraph, possibly changing their type
    pub fn map_edges<F: Fn(A) -> T, T>(self, f: F) -> Hypergraph<O, T> {
        // note: unwrap is safe because length is preserved
        self.with_edges(|edges| edges.into_iter().map(f).collect())
            .unwrap()
    }

    /// Delete the specified edges and their adjacency information.
    ///
    /// Panics if any edge id is out of bounds.
    pub fn delete_edges(&mut self, edge_ids: &[EdgeId]) {
        let edge_count = self.edges.len();
        assert_eq!(
            edge_count,
            self.adjacency.len(),
            "malformed hypergraph: edges and adjacency lengths differ"
        );

        if edge_ids.is_empty() {
            return;
        }

        let mut remove = vec![false; edge_count];
        let mut any_removed = false;
        let mut remove_count = 0usize;
        for edge_id in edge_ids {
            assert!(
                edge_id.0 < edge_count,
                "edge id {:?} is out of bounds",
                edge_id
            );
            if !remove[edge_id.0] {
                remove[edge_id.0] = true;
                any_removed = true;
                remove_count += 1;
            }
        }

        if !any_removed {
            return;
        }

        let mut edges = Vec::with_capacity(edge_count - remove_count);
        let mut adjacency = Vec::with_capacity(edge_count - remove_count);
        for (i, (edge, adj)) in self
            .edges
            .drain(..)
            .zip(self.adjacency.drain(..))
            .enumerate()
        {
            if !remove[i] {
                edges.push(edge);
                adjacency.push(adj);
            }
        }

        self.edges = edges;
        self.adjacency = adjacency;
    }

    /// Renamed to `delete_edges` for consistency
    #[deprecated(since = "0.2.10", note = "renamed delete_edges")]
    pub fn delete_edge(&mut self, edge_ids: &[EdgeId]) {
        self.delete_edges(edge_ids)
    }

    /// Delete the specified nodes, remapping remaining node indices in adjacency and quotient.
    ///
    /// Returns the renumber map: `map[old] = Some(new)` for surviving nodes, `None` for deleted.
    /// Panics if any node id is out of bounds.
    pub fn delete_nodes_witness(&mut self, node_ids: &[NodeId]) -> Vec<Option<usize>> {
        if node_ids.is_empty() {
            return (0..self.nodes.len()).map(Some).collect();
        }

        let node_count = self.nodes.len();
        let mut remove = vec![false; node_count];
        let mut any_removed = false;
        let mut remove_count = 0usize;
        for node_id in node_ids {
            assert!(
                node_id.0 < node_count,
                "node id {:?} is out of bounds",
                node_id
            );
            if !remove[node_id.0] {
                remove[node_id.0] = true;
                any_removed = true;
                remove_count += 1;
            }
        }

        if !any_removed {
            return (0..node_count).map(Some).collect();
        }

        let mut new_index = vec![None; node_count];
        let mut nodes = Vec::with_capacity(node_count - remove_count);
        for (i, node) in self.nodes.drain(..).enumerate() {
            if !remove[i] {
                let next = nodes.len();
                new_index[i] = Some(next);
                nodes.push(node);
            }
        }
        self.nodes = nodes;

        for edge in &mut self.adjacency {
            edge.sources = edge
                .sources
                .iter()
                .filter_map(|node| new_index[node.0].map(NodeId))
                .collect();
            edge.targets = edge
                .targets
                .iter()
                .filter_map(|node| new_index[node.0].map(NodeId))
                .collect();
        }

        let mut quotient_left = Vec::with_capacity(self.quotient.0.len());
        let mut quotient_right = Vec::with_capacity(self.quotient.1.len());
        for (v, w) in self.quotient.0.iter().zip(self.quotient.1.iter()) {
            if let (Some(v_new), Some(w_new)) = (new_index[v.0], new_index[w.0]) {
                quotient_left.push(NodeId(v_new));
                quotient_right.push(NodeId(w_new));
            }
        }
        self.quotient = (quotient_left, quotient_right);

        new_index
    }

    /// Delete the specified nodes, remapping remaining node indices in adjacency and quotient.
    ///
    /// Panics if any node id is out of bounds.
    pub fn delete_nodes(&mut self, node_ids: &[NodeId]) {
        self.delete_nodes_witness(node_ids);
    }
}

impl<O: Clone + PartialEq, A: Clone> Hypergraph<O, A> {
    /// Mutably quotient this [`Hypergraph`], returning the coequalizer calculated from
    /// `self.quotient`.
    /// An [`Ok`] result means the hypergraph was quotiented.
    /// An [`Err`] means the quotient map was invalid: some quotiented nodes had inequal values.
    pub fn quotient(&mut self) -> Result<FiniteFunction<VecKind>, FiniteFunction<VecKind>> {
        use std::mem::take;
        let q = self.coequalizer();

        self.nodes = match coequalizer_universal(&q, &VecArray(take(&mut self.nodes))) {
            Some(nodes) => nodes.0,
            None => return Err(q),
        };

        // map hyperedges
        for e in &mut self.adjacency {
            e.sources.iter_mut().for_each(|x| *x = NodeId(q.table[x.0]));
            e.targets.iter_mut().for_each(|x| *x = NodeId(q.table[x.0]));
        }

        // clear the quotient map (we just used it)
        self.quotient = (vec![], vec![]); // empty
        Ok(q)
    }
}

impl<O: Clone, A: Clone> Hypergraph<O, A> {
    pub fn to_hypergraph(&self) -> crate::strict::Hypergraph<VecKind, O, A> {
        make_hypergraph(self)
    }

    pub fn coequalizer(&self) -> FiniteFunction<VecKind> {
        // Compute the coequalizer (connected components) of the quotient graph
        let s: FiniteFunction<VecKind> = FiniteFunction {
            table: VecArray(self.quotient.0.iter().map(|x| x.0).collect()),
            target: self.nodes.len(),
        };

        let t: FiniteFunction<VecKind> = FiniteFunction {
            table: VecArray(self.quotient.1.iter().map(|x| x.0).collect()),
            target: self.nodes.len(),
        };

        s.coequalizer(&t)
            .expect("coequalizer must exist for any graph")
    }
}

pub(crate) fn finite_function_coproduct(
    v1: &[NodeId],
    v2: &[NodeId],
    target: usize,
) -> Vec<NodeId> {
    v1.iter()
        .cloned()
        .chain(v2.iter().map(|&s| NodeId(s.0 + target)))
        .collect()
}

pub(crate) fn concat<T: Clone>(v1: &[T], v2: &[T]) -> Vec<T> {
    v1.iter().cloned().chain(v2.iter().cloned()).collect()
}

impl<O: Clone, A: Clone> Hypergraph<O, A> {
    pub(crate) fn coproduct(&self, other: &Hypergraph<O, A>) -> Hypergraph<O, A> {
        let n = self.nodes.len();

        let adjacency = self
            .adjacency
            .iter()
            .cloned()
            .chain(other.adjacency.iter().map(|edge| Hyperedge {
                sources: edge.sources.iter().map(|&s| NodeId(s.0 + n)).collect(),
                targets: edge.targets.iter().map(|&t| NodeId(t.0 + n)).collect(),
            }))
            .collect();

        let quotient = (
            finite_function_coproduct(&self.quotient.0, &other.quotient.0, n),
            finite_function_coproduct(&self.quotient.1, &other.quotient.1, n),
        );

        Hypergraph {
            nodes: concat(&self.nodes, &other.nodes),
            edges: concat(&self.edges, &other.edges),
            adjacency,
            quotient,
        }
    }
}

/// Create a [`crate::strict::hypergraph::Hypergraph`] by forgetting about the quotient map.
fn make_hypergraph<O: Clone, A: Clone>(
    h: &Hypergraph<O, A>,
) -> crate::strict::hypergraph::Hypergraph<VecKind, O, A> {
    use crate::finite_function::*;
    use crate::indexed_coproduct::*;
    use crate::semifinite::*;

    let s = {
        let mut lengths = Vec::<usize>::with_capacity(h.edges.len());
        let mut values = Vec::<usize>::new();
        for e in h.adjacency.iter() {
            lengths.push(e.sources.len());
            values.extend(e.sources.iter().map(|x| x.0));
        }

        let sources = SemifiniteFunction(VecArray(lengths));
        let values =
            FiniteFunction::new(VecArray(values), h.nodes.len()).expect("invalid lax::Hypergraph!");
        IndexedCoproduct::from_semifinite(sources, values).expect("valid IndexedCoproduct")
    };

    let t = {
        let mut lengths = Vec::<usize>::with_capacity(h.edges.len());
        let mut values = Vec::<usize>::new();
        for e in h.adjacency.iter() {
            lengths.push(e.targets.len());
            values.extend(e.targets.iter().map(|x| x.0));
        }

        let sources = SemifiniteFunction(VecArray(lengths));
        let values =
            FiniteFunction::new(VecArray(values), h.nodes.len()).expect("invalid lax::Hypergraph!");
        IndexedCoproduct::from_semifinite(sources, values).expect("valid IndexedCoproduct")
    };

    let w = SemifiniteFunction(VecArray(h.nodes.clone()));
    let x = SemifiniteFunction(VecArray(h.edges.clone()));

    crate::strict::hypergraph::Hypergraph { s, t, w, x }
}