chain: a prototype is added.

I have an ostensibly working prototype now.

Further tests are needed to make sure that the algorithm meets the
time complexity requirement, though.

1 files changed, 0 insertions, 3 deletions

diff --git a/graph/src/error.rs b/graph/src/error.rs
index ce45acc..bf2714b 100644
--- a/graph/src/error.rs
+++ b/graph/src/error.rs
@@ -18,8 +18,6 @@ pub enum Error {
     /// The graph does not permit duplicate edges but encounters a
     /// repeated edge.
     DuplicatedEdge(usize, usize),
-    /// The source node has no room to add a new edge.
-    FullNode(usize),
 }
 
 impl Display for Error {
@@ -37,7 +35,6 @@ impl Display for Error {
                     "No duplicate edges permitted, but found one from {source} to {target}"
                 )
             }
-            Error::FullNode(index) => write!(f, "the node {index} has no room for new edges"),
         }
     }
 }