//! Defines different traits of graphs.

use crate::{EdgeId, IdType, NodeId};

/// A basic graph.
///
/// Graphs defining this trait can act as containers for nodes and edges.
/// Their functionality is very limited though, as not even navigation is defined.
pub trait Graph<N, E> {
    /// An iterator over all node ids of a graph.
    type NodeIdIterator: Iterator<Item = NodeId>;
    /// An iterator over all edge ids of a graph.
    type EdgeIdIterator: Iterator<Item = EdgeId>;

    /// The amount of nodes in the graph.
    fn node_len(&self) -> IdType;

    /// The amount of edges in the graph.
    fn edge_len(&self) -> IdType;

    /// Returns an iterator over all node ids in the graph.
    fn node_id_iter(&self) -> Self::NodeIdIterator;

    /// Returns an iterator over all edge ids in the graph.
    fn edge_id_iter(&self) -> Self::EdgeIdIterator;

    /// Returns a reference to a nodes data, identified by the given id.
    fn node_data(&self, id: NodeId) -> &N;

    /// Returns a reference to an edges data, identified by the given id.
    fn edge_data(&self, id: EdgeId) -> &E;

    /// Returns an edge instance, identified by the given id.
    fn edge(&self, id: EdgeId) -> EdgeRef<E>;

    /// Returns the start node of the edge identified by the given id.
    fn edge_start(&self, id: EdgeId) -> NodeId;

    /// Returns the end node of the edge identified by the given id.
    fn edge_end(&self, id: EdgeId) -> NodeId;

    /// Returns true if the given `NodeId` refers to a node in this graph.
    fn is_node_id_valid(&self, id: NodeId) -> bool;

    /// Returns true if the given `EdgeId` refers to an edge in this graph.
    fn is_edge_id_valid(&self, id: EdgeId) -> bool;
}

// TODO implement as soon as https://github.com/rust-lang/rust/issues/29661 is implemented
/*/// A graph that supports efficient iterations of nodes and edges.
///
/// Accessing nodes or edges by ids one by one might be less efficient than iterating over the nodes and edges directly.
/// If that is the case, the provided default methods in this trait should be overwritten with the more efficient variant.
pub trait IterableGraph<'a, N: 'a, E: 'a>: Graph<N, E> {
    /// An iterator over all nodes of a graph.
    type NodeIterator: Iterator<Item = (NodeId, NodeRef<'a, N>)> = std::iter::Map<<Self as Graph<N, E>>::NodeIdIterator, fn(NodeId) -> (NodeId, NodeRef<'a, N>)>;
    /// An iterator over all edges of a graph.
    type EdgeIterator: Iterator<Item = (EdgeId, EdgeRef<'a, E>)> = std::iter::Map<<Self as Graph<N, E>>::EdgeIdIterator, fn(EdgeId) -> (EdgeId, EdgeRef<'a, E>)>;

    /// Returns an iterator over all nodes in the graph.
    fn node_iter(&self) -> Self::NodeIterator {
        self.node_id_iter().map(|id| (id, NodeRef::new(self.node_data(id))))
    }

    /// Returns an iterator over all edges in the graph.
    fn edge_iter(&self) -> Self::EdgeIterator {
        self.edge_id_iter().map(|id| (id, self.edge(id)))
    }
}*/

/// A forward navigable graph.
///
/// Graphs implementing this trait are able to output a nodes out-edges efficiently.
/// For undirected graphs, out-edges and in-edges are the same.
pub trait ForwardNavigableGraph<'a, N, E>: Graph<N, E> {
    /// An iterator over the out-edges of a node.
    type OutEdgeIterator: Iterator<Item = EdgeId> + 'a;

    /// Returns an iterator over the out-edges of the node identified by the given id.
    fn out_edges(&self, id: NodeId) -> Self::OutEdgeIterator;
}

/// A backward navigable graph.
///
/// Graphs implementing this trait are able to output a nodes in-edges efficiently.
/// For undirected graphs, out-edges and in-edges are the same.
pub trait BackwardNavigableGraph<'a, N, E>: Graph<N, E> {
    /// An iterator over the in-edges of a node.
    type InEdgeIterator: Iterator<Item = EdgeId> + 'a;

    /// Returns an iterator over the in-edges of the node identified by the given id.
    fn in_edges(&self, id: NodeId) -> Self::InEdgeIterator;
}

/// A mutable graph.
///
/// Graphs implementing this trait are able to be updated efficiently.
pub trait MutableGraph<N, E> {
    /// Creates a new empty graph.
    fn new() -> Self;

    /// Adds the given node to the graph.
    /// The return value is the id assigned to the new node.
    fn add_node(&mut self, node: Node<N>) -> NodeId;

    /// Adds the given edge to the graph.
    /// The return value is the id assigned to the new edge, or an error, if the edge refers a non-existing node.
    fn add_edge(&mut self, edge: Edge<E>) -> Result<EdgeId, GraphModificationError>;
}

/// An error type for graph modifications.
/// This type is used by the `MutableGraph` trait.
#[derive(Debug)]
pub enum GraphModificationError {
    /// An edge that refers to a nonexistent start node was added to the graph
    StartNodeDoesNotExist,
    /// An edge that refers to a nonexistent end node was added to the graph
    EndNodeDoesNotExist,
}

/// A container for a node.
/// Can be used to add nodes to a `MutableGraph`.
#[derive(Debug)]
pub struct Node<N> {
    data: N,
}

/// A container for an edge.
/// Can be used to add nodes to a `MutableGraph`.
#[derive(Debug)]
pub struct Edge<E> {
    start: NodeId,
    end: NodeId,
    data: E,
}

/// A container for a node.
/// Is returned by `Graph` when a complete node instance is requested.
#[derive(Debug, Eq, PartialEq)]
pub struct NodeRef<'a, N> {
    data: &'a N,
}

/// A container for an edge.
/// Is returned by `Graph` when a complete edge instance is requested.
#[derive(Debug, Eq, PartialEq)]
pub struct EdgeRef<'a, E> {
    start: NodeId,
    end: NodeId,
    data: &'a E,
}

impl<N> Node<N> {
    /// Creates a new node with the given node data.
    pub fn new(data: N) -> Self {
        Self { data }
    }

    /// Returns the data of this node.
    pub fn data(&self) -> &N {
        &self.data
    }
}

impl<E> Edge<E> {
    /// Creates a new edge with the given edge data.
    pub fn new(start: NodeId, end: NodeId, data: E) -> Self {
        Self { start, end, data }
    }

    /// Returns the id of the start node of this edge.
    pub fn start(&self) -> NodeId {
        self.start
    }

    /// Returns the id of the end node of this edge.
    pub fn end(&self) -> NodeId {
        self.end
    }

    /// Returns the data of this edge.
    pub fn data(&self) -> &E {
        &self.data
    }
}

impl<'a, N> NodeRef<'a, N> {
    /// Creates a new node ref with the given node data.
    /// This method should not be used by the client.
    // TODO Change to crate visibility once stable
    pub fn new(data: &'a N) -> Self {
        Self { data }
    }

    /// Returns a reference to the data of this node.
    pub fn data(&self) -> &'a N {
        self.data
    }
}

impl<'a, E> EdgeRef<'a, E> {
    /// Creates a new edge ref with the given edge data.
    /// This method should not be used by the client.
    // TODO Change to crate visibility once stable
    pub fn new(start: NodeId, end: NodeId, data: &'a E) -> Self {
        Self { start, end, data }
    }

    /// Returns the id of the start node of this edge.
    pub fn start(&self) -> NodeId {
        self.start
    }

    /// Returns the id of the end node of this edge.
    pub fn end(&self) -> NodeId {
        self.end
    }

    /// Returns a reference to the data of this edge.
    pub fn data(&self) -> &'a E {
        self.data
    }
}

impl<'a, E> From<&'a Edge<E>> for EdgeRef<'a, E> {
    fn from(edge: &'a Edge<E>) -> Self {
        EdgeRef::new(edge.start(), edge.end(), edge.data())
    }
}

impl<'a, E: Clone> From<&EdgeRef<'a, E>> for Edge<E> {
    fn from(edge: &EdgeRef<'a, E>) -> Self {
        Edge::new(edge.start(), edge.end(), edge.data().clone())
    }
}

impl<'a, E: Clone> From<EdgeRef<'a, E>> for Edge<E> {
    fn from(edge: EdgeRef<'a, E>) -> Self {
        Edge::from(&edge)
    }
}