impl graph via vec instead of a hashmap

src/graph/directed_graph.rs

@@ -9,16 +9,15 @@ use std::{
 
 use super::{GraphError, VertexIndex};
 
-/// representing a graph using an adjacency list which is
-/// 1) An array containing the graph vertices
-/// 2) An array containing the graph edges
-/// 3) For each edge, a pointer to each of its two endpoints
-/// 4) for each vertex, a pointer to each of the incident edges
-///
-/// for directed graph:
-/// each edge keeps track of which endpoint is tail and which endpoint is head
-/// each vertex maintains two arrays of pointers, one for the outgoing edges and one for the incoming edges
-///
+// representing a graph using an adjacency list which is
+// 1) An array containing the graph vertices
+// 2) An array containing the graph edges
+// 3) For each edge, a pointer to each of its two endpoints
+// 4) for each vertex, a pointer to each of the incident edges
+//
+// for directed graph:
+// each edge keeps track of which endpoint is tail and which endpoint is head
+// each vertex maintains two arrays of pointers, one for the outgoing edges and one for the incoming edges
 
 type VertexRc = Rc<RefCell<Vertex>>;
 type VertexWeak = Weak<RefCell<Vertex>>;

src/graph/types.rs

@@ -9,6 +9,6 @@ pub enum GraphError {
 }
 
 pub trait Graph {
-    fn add_vertex(&mut self, index: VertexIndex, value: char);
+    fn add_vertex(&mut self);
     fn add_edge(&mut self, from: VertexIndex, to: VertexIndex) -> Result<(), GraphError>;
 }