Merge pull request #23 from bluss/next

0.1.14
diff --git a/Cargo.toml b/Cargo.toml
index 4a3a0dd..3e33cfd 100644
--- a/Cargo.toml
+++ b/Cargo.toml
@@ -1,7 +1,7 @@
 [package]
 
 name = "petgraph"
-version = "0.1.13"
+version = "0.1.14"
 license = "MIT/Apache-2.0"
 authors = [
 "bluss",
@@ -19,7 +19,6 @@
 name = "petgraph"
 
 [profile.release]
-debug = true
 
 [profile.bench]
 debug = true
diff --git a/README.rst b/README.rst
index 4c9e629..62e9ddb 100644
--- a/README.rst
+++ b/README.rst
@@ -19,6 +19,11 @@
 Recent Changes
 --------------
 
+- 0.1.14
+
+  - Add new topological order visitor Topo
+  - New graph traits NeighborsDirected, Externals, Revisitable
+
 - 0.1.13
 
   - Add iterator GraphMap::all_edges
diff --git a/src/isomorphism.rs b/src/isomorphism.rs
index 556a08d..2dcce5a 100644
--- a/src/isomorphism.rs
+++ b/src/isomorphism.rs
@@ -1,5 +1,5 @@
 use std::marker;
-use fb::FixedBitSet;
+use fixedbitset::FixedBitSet;
 
 use super::{
     EdgeType,
diff --git a/src/lib.rs b/src/lib.rs
index 5a26ea9..dbbc992 100644
--- a/src/lib.rs
+++ b/src/lib.rs
@@ -9,7 +9,7 @@
 //! is an undirected hashmap-backed graph which only allows simple node identifiers
 //! (such as integers or references).
 
-extern crate fixedbitset as fb;
+extern crate fixedbitset;
 
 use std::cmp::Ordering;
 use std::hash::{self, Hash};
diff --git a/src/traits_graph.rs b/src/traits_graph.rs
index 90cb329..7e23cf4 100644
--- a/src/traits_graph.rs
+++ b/src/traits_graph.rs
@@ -1,4 +1,5 @@
-use fb::FixedBitSet;
+
+use fixedbitset::FixedBitSet;
 
 use super::{
     EdgeType,
diff --git a/src/visit.rs b/src/visit.rs
index 3b13db5..4f7c6bb 100644
--- a/src/visit.rs
+++ b/src/visit.rs
@@ -1,12 +1,12 @@
 //! Graph visitor algorithms.
 //!
 
+use fixedbitset::FixedBitSet;
 use std::collections::{
     HashSet,
     VecDeque,
 };
 use std::hash::Hash;
-use fb::FixedBitSet;
 
 use super::{
     graphmap,