commit 2cda4fadf30f69dc0f6f1acac8bb2f6b09555fed
author root <root@localhost> Fri Jan 16 22:13:14 2015 +0100
committer root <root@localhost> Fri Jan 16 22:13:14 2015 +0100
tree aefa0716c228a9c4e360e3e14b0c57420a903079
parent 97890f2a277a2b75a2678a55b8f03b1af2635a5e

Fix unused imports

src/graph.rs

diff --git a/src/graph.rs b/src/graph.rs
index 300c81b..0b1567f 100644
--- a/src/graph.rs
+++ b/src/graph.rs
@@ -1,6 +1,5 @@
 //! **Graph\<N, E, Ty\>** is a graph datastructure using an adjacency list representation.
 
-use std::hash::{Hash};
 use std::fmt;
 use std::slice;
 use std::iter;
@@ -21,7 +20,6 @@
 use super::visit::{
     Reversed,
     Dfs,
-    Visitable,
     VisitMap,
 };
 

src/lib.rs

diff --git a/src/lib.rs b/src/lib.rs
index 8060f19..bbfd0a2 100644
--- a/src/lib.rs
+++ b/src/lib.rs
@@ -7,7 +7,6 @@
 //! It is based on rustc's graph implementation.
 
 use std::cmp::Ordering;
-use std::cell::Cell;
 use std::hash::{self, Hash};
 use std::collections::hash_map::Hasher;
 use std::fmt;

src/visit.rs

diff --git a/src/visit.rs b/src/visit.rs
index a90cc10..d373a3d 100644
--- a/src/visit.rs
+++ b/src/visit.rs
@@ -7,7 +7,6 @@
     BinaryHeap,
     HashSet,
     HashMap,
-    Bitv,
     BitvSet,
     RingBuf,
 };