1 files changed, 6 insertions, 51 deletions

diff --git a/chain/src/item/default/mod.rs b/chain/src/item/default/mod.rs
index 3903162..6d28956 100644
--- a/chain/src/item/default/mod.rs
+++ b/chain/src/item/default/mod.rs
@@ -8,6 +8,8 @@ use graph::{
     builder::BuilderMut, labelled::binary::PLGBuilderMut, Graph, LabelGraph, PLGraph, RedirectGraph,
 };
 
+use graph_macro::Graph;
+
 use std::collections::HashSet;
 
 use core::fmt::Display;
@@ -73,7 +75,7 @@ impl From<ForestLabelError> for Error {
 }
 
 /// A default implementation of forest.
-#[derive(Debug, Clone)]
+#[derive(Debug, Clone, Graph)]
 pub struct DefaultForest<T: GraphLabel> {
     pub(crate) graph: PLGraph<T>,
     root: Option<usize>,
@@ -94,56 +96,6 @@ impl<T: GraphLabel> AsRef<DefaultForest<T>> for DefaultForest<T> {
     }
 }
 
-impl<T: GraphLabel> Graph for DefaultForest<T> {
-    type Iter<'a> = <PLGraph<T> as Graph>::Iter<'a>
-    where
-        Self: 'a;
-
-    #[inline]
-    fn is_empty(&self) -> bool {
-        self.graph.is_empty()
-    }
-
-    #[inline]
-    fn nodes_len(&self) -> usize {
-        self.graph.nodes_len()
-    }
-
-    #[inline]
-    fn edges_len(&self) -> Option<usize> {
-        self.graph.edges_len()
-    }
-
-    #[inline]
-    fn children_of(&self, node_id: usize) -> Result<Self::Iter<'_>, GError> {
-        self.graph.children_of(node_id)
-    }
-
-    #[inline]
-    fn degree(&self, node_id: usize) -> Result<usize, GError> {
-        self.graph.degree(node_id)
-    }
-
-    #[inline]
-    fn is_empty_node(&self, node_id: usize) -> Result<bool, GError> {
-        self.graph.is_empty_node(node_id)
-    }
-
-    #[inline]
-    fn has_edge(&self, source: usize, target: usize) -> Result<bool, GError> {
-        self.graph.has_edge(source, target)
-    }
-
-    fn replace_by_builder(&mut self, _builder: impl graph::Builder<Result = Self>) {
-        unimplemented!()
-    }
-
-    #[inline]
-    fn print_viz(&self, filename: &str) -> Result<(), std::io::Error> {
-        self.graph.print_viz(filename)
-    }
-}
-
 impl<T: GraphLabel> ParentsGraph for DefaultForest<T> {
     type Iter<'a>= <PLGraph<T> as ParentsGraph>::Iter<'a>
     where
@@ -1081,6 +1033,9 @@ impl DefaultForest<ForestLabel<GrammarLabel>> {
     // }
 
     /// Set the position of every node.
+    ///
+    /// If ALLP is non-nil or if the node is a terminal node, also set
+    /// the ending position.
     pub(crate) fn set_pos(&mut self, pos: usize, allp: bool) -> Result<(), Error> {
         let mut builder = PLGBuilderMut::from_graph_mut(&mut self.graph);