diff --git a/include/boost/graph/distributed/adjacency_list.hpp b/include/boost/graph/distributed/adjacency_list.hpp
index 82fad07..2f7c3bb 100644
--- a/include/boost/graph/distributed/adjacency_list.hpp
+++ b/include/boost/graph/distributed/adjacency_list.hpp
@@ -2501,9 +2501,6 @@ namespace boost {
     std::pair<edge_descriptor, bool> result
       = this->add_local_edge(property, directedS());
 
-    typedef detail::parallel::stored_in_edge<local_edge_descriptor>
-      stored_edge;
-
     if (result.second) {
       if (target.owner == self.processor()) {
         // Edge is local, so add the new edge to the list
@@ -3045,8 +3042,6 @@ namespace boost {
               typename PBGL_DISTRIB_ADJLIST_TYPE::vertex_descriptor v,
               PBGL_DISTRIB_ADJLIST_TYPE& g)
   {
-    typedef typename PBGL_DISTRIB_ADJLIST_TYPE
-                       ::vertex_descriptor vertex_descriptor;
     typedef typename PBGL_DISTRIB_ADJLIST_TYPE
                        ::edge_descriptor edge_descriptor;
     std::pair<edge_descriptor, bool> the_edge = edge(u, v, g);
@@ -3777,7 +3772,6 @@ namespace boost {
   template<PBGL_DISTRIB_ADJLIST_TEMPLATE_PARMS>
   void synchronize(const PBGL_DISTRIB_ADJLIST_TYPE& g)
   {
-    typedef PBGL_DISTRIB_ADJLIST_TYPE graph_type;
     synchronize(g.process_group());
   }
 
diff --git a/include/boost/graph/distributed/adjlist/redistribute.hpp b/include/boost/graph/distributed/adjlist/redistribute.hpp
index 5401f12..c2ab02e 100644
--- a/include/boost/graph/distributed/adjlist/redistribute.hpp
+++ b/include/boost/graph/distributed/adjlist/redistribute.hpp
@@ -179,7 +179,6 @@ PBGL_DISTRIB_ADJLIST_TYPE
   typedef detail::parallel::redistributed_descriptor<edge_descriptor, 
                                                      edge_property_type>
     redistributed_edge;
-  typedef std::pair<vertices_size_type, edges_size_type> num_relocated_pair;
 
   vertex_iterator vi, vi_end;
   edge_iterator ei, ei_end;
diff --git a/include/boost/graph/distributed/adjlist/serialization.hpp b/include/boost/graph/distributed/adjlist/serialization.hpp
index d904c5a..ab75ef9 100644
--- a/include/boost/graph/distributed/adjlist/serialization.hpp
+++ b/include/boost/graph/distributed/adjlist/serialization.hpp
@@ -776,7 +776,6 @@ void save_in_edges(Archive& ar, Graph const& g, bidirectionalS)
 
     process_id_type id = g.processor();
 
-    typedef std::pair<local_vertex_descriptor, vertex_descriptor> in_edge;
     std::vector<edge_descriptor> saved_in_edges;
 
     BGL_FORALL_VERTICES_T(v, g, Graph) 
@@ -830,8 +829,6 @@ void save_edges(Archive& ar, Graph const& g, DirectedS)
         process_id_type;
     typedef typename graph_traits<
         Graph>::vertex_descriptor vertex_descriptor;
-    typedef typename graph_traits<
-        Graph>::edge_descriptor edge_descriptor;
 
     typedef typename Graph::edge_property_type edge_property_type;
 
@@ -880,8 +877,6 @@ template <PBGL_DISTRIB_ADJLIST_TEMPLATE_PARMS>
 template <class IStreamConstructibleArchive>
 void PBGL_DISTRIB_ADJLIST_TYPE::load(std::string const& filename)
 {
-    typedef typename config_type::VertexListS vertex_list_selector;
-
     process_group_type pg = process_group();
     process_id_type id = process_id(pg);
 
diff --git a/include/boost/graph/distributed/betweenness_centrality.hpp b/include/boost/graph/distributed/betweenness_centrality.hpp
index 04d249a..1c4b5a9 100644
--- a/include/boost/graph/distributed/betweenness_centrality.hpp
+++ b/include/boost/graph/distributed/betweenness_centrality.hpp
@@ -621,12 +621,6 @@ namespace boost {
 #endif
                )
     {  
-      typedef typename property_traits<DistanceMap>::value_type 
-        distance_type;
-
-      typedef std::plus<distance_type> Combine;
-      typedef std::less<distance_type> Compare;
-
       // The "distance" map needs to act like one, retrieving the default
       // value of infinity.
       set_property_map_role(vertex_distance, distance);
@@ -717,7 +711,6 @@ namespace boost {
     using boost::graph::parallel::process_group;
 
     typedef typename graph_traits<Graph>::vertex_descriptor vertex_descriptor;
-    typedef typename graph_traits<Graph>::vertex_iterator vertex_iterator;
     typedef typename graph_traits<Graph>::edges_size_type edges_size_type;
 
     typedef typename property_traits<IncomingMap>::value_type incoming_type;
@@ -974,10 +967,7 @@ namespace boost {
     using boost::detail::graph::divide_centrality_by_two;       
     using boost::graph::parallel::process_group;
     
-    typedef typename graph_traits<Graph>::vertex_iterator vertex_iterator;
-    typedef typename graph_traits<Graph>::edge_iterator edge_iterator;
     typedef typename graph_traits<Graph>::vertex_descriptor vertex_descriptor;
-    typedef typename graph_traits<Graph>::vertices_size_type vertices_size_type;
 
     typedef typename property_traits<DistanceMap>::value_type distance_type;
     typedef typename property_traits<DependencyMap>::value_type dependency_type;
@@ -1064,11 +1054,8 @@ namespace boost {
   {
     using boost::detail::graph::update_centrality;
 
-    typedef typename graph_traits<Graph>::vertex_iterator vertex_iterator;
     typedef typename graph_traits<Graph>::vertex_descriptor vertex_descriptor;
 
-    typedef typename property_traits<IncomingMap>::value_type incoming_type;
-
     // Initialize for this iteration
     BGL_FORALL_VERTICES_T(w, g, Graph) {
       // put(path_count, w, 0);
@@ -1137,12 +1124,7 @@ namespace boost {
     using boost::detail::graph::divide_centrality_by_two;       
     using boost::graph::parallel::process_group;
 
-    typedef typename graph_traits<Graph>::vertex_iterator vertex_iterator;
-    typedef typename graph_traits<Graph>::edge_iterator edge_iterator;
     typedef typename graph_traits<Graph>::vertex_descriptor vertex_descriptor;
-    typedef typename graph_traits<Graph>::vertices_size_type vertices_size_type;
-
-    typedef typename property_traits<DistanceMap>::value_type distance_type;
 
     typedef ProcessGroup process_group_type;
 
@@ -1352,10 +1334,6 @@ namespace graph { namespace parallel { namespace detail {
     typedef typename graph_traits<Graph>::degree_size_type degree_size_type;
     typedef typename graph_traits<Graph>::edges_size_type edges_size_type;
     typedef typename graph_traits<Graph>::vertex_descriptor vertex_descriptor;
-    typedef typename mpl::if_c<(is_same<CentralityMap, 
-                                        dummy_property_map>::value),
-                                         EdgeCentralityMap, 
-                               CentralityMap>::type a_centrality_map;
 
     typename graph_traits<Graph>::vertices_size_type V = num_vertices(g);
     
@@ -1472,9 +1450,6 @@ non_distributed_brandes_betweenness_centrality(const ProcessGroup& pg,
                                                VertexIndexMap vertex_index,
                                                Buffer sources)
 {
-  typedef typename property_traits<DistanceMap>::value_type distance_type;
-  typedef static_property_map<distance_type> WeightMap;
-  
   detail::graph::brandes_unweighted_shortest_paths shortest_paths;
   
   graph::parallel::detail::non_distributed_brandes_betweenness_centrality_impl(pg, g, centrality, 
@@ -1528,7 +1503,6 @@ namespace detail { namespace graph {
                                                            Buffer sources)
   {
     typedef typename graph_traits<Graph>::degree_size_type degree_size_type;
-    typedef typename graph_traits<Graph>::vertex_descriptor vertex_descriptor;
     typedef typename graph_traits<Graph>::edge_descriptor edge_descriptor;
     typedef typename mpl::if_c<(is_same<CentralityMap, 
                                         dummy_property_map>::value),
@@ -1565,7 +1539,6 @@ namespace detail { namespace graph {
                                                            Buffer sources)
   {
     typedef typename graph_traits<Graph>::degree_size_type degree_size_type;
-    typedef typename graph_traits<Graph>::vertex_descriptor vertex_descriptor;
     typedef typename graph_traits<Graph>::edge_descriptor edge_descriptor;
     typedef typename mpl::if_c<(is_same<CentralityMap, 
                                         dummy_property_map>::value),
diff --git a/include/boost/graph/distributed/boman_et_al_graph_coloring.hpp b/include/boost/graph/distributed/boman_et_al_graph_coloring.hpp
index f079afe..2a447a3 100644
--- a/include/boost/graph/distributed/boman_et_al_graph_coloring.hpp
+++ b/include/boost/graph/distributed/boman_et_al_graph_coloring.hpp
@@ -123,7 +123,6 @@ boman_et_al_graph_coloring
     process_group_type;
   typedef typename process_group_type::process_id_type process_id_type;
   typedef typename graph_traits<DistributedGraph>::vertex_descriptor Vertex;
-  typedef typename graph_traits<DistributedGraph>::edge_descriptor Edge;
   typedef typename graph_traits<DistributedGraph>::vertices_size_type 
     vertices_size_type;
   typedef typename property_traits<ColorMap>::value_type color_type;
diff --git a/include/boost/graph/distributed/breadth_first_search.hpp b/include/boost/graph/distributed/breadth_first_search.hpp
index 36e2df8..5bb99c6 100644
--- a/include/boost/graph/distributed/breadth_first_search.hpp
+++ b/include/boost/graph/distributed/breadth_first_search.hpp
@@ -151,8 +151,7 @@ namespace boost {
        ColorMap color,
        BFSVisitor vis,
        const bgl_named_params<P, T, R>& params,
-       BOOST_GRAPH_ENABLE_IF_MODELS(DistributedGraph, distributed_graph_tag,
-                                    void)*)
+       boost::mpl::true_)
         {
             parallel_bfs_helper
         (g, s, color, vis, get_param(params, buffer_param_t()),
diff --git a/include/boost/graph/distributed/compressed_sparse_row_graph.hpp b/include/boost/graph/distributed/compressed_sparse_row_graph.hpp
index 33861c4..6d7d839 100644
--- a/include/boost/graph/distributed/compressed_sparse_row_graph.hpp
+++ b/include/boost/graph/distributed/compressed_sparse_row_graph.hpp
@@ -537,7 +537,6 @@ out_degree(typename BOOST_DISTRIB_CSR_GRAPH_TYPE::vertex_descriptor u,
 template<BOOST_DISTRIB_CSR_GRAPH_TEMPLATE_PARMS>
 void synchronize(const BOOST_DISTRIB_CSR_GRAPH_TYPE& g)
 {
-  typedef BOOST_DISTRIB_CSR_GRAPH_TYPE graph_type;
   synchronize(g.process_group());
 }
 
diff --git a/include/boost/graph/distributed/concepts.hpp b/include/boost/graph/distributed/concepts.hpp
index 1c85b44..9d6e267 100644
--- a/include/boost/graph/distributed/concepts.hpp
+++ b/include/boost/graph/distributed/concepts.hpp
@@ -29,10 +29,6 @@
 
 namespace boost { 
 
-class distributed_graph_tag { };
-class distributed_vertex_list_graph_tag { };
-class distributed_edge_list_graph_tag { };
-
 #if BOOST_VERSION >= 103500
   namespace concepts {
 #endif
diff --git a/include/boost/graph/distributed/connected_components.hpp b/include/boost/graph/distributed/connected_components.hpp
index 4289290..3650efb 100644
--- a/include/boost/graph/distributed/connected_components.hpp
+++ b/include/boost/graph/distributed/connected_components.hpp
@@ -296,14 +296,8 @@ namespace boost { namespace graph { namespace distributed {
 
       typedef typename graph_traits<DistributedGraph>::adjacency_iterator
         adjacency_iterator;
-      typedef typename graph_traits<DistributedGraph>::out_edge_iterator
-        out_edge_iterator;
-      typedef typename graph_traits<DistributedGraph>::edge_iterator
-        edge_iterator;
       typedef typename graph_traits<DistributedGraph>::vertex_descriptor
         vertex_descriptor;
-      typedef typename graph_traits<DistributedGraph>::edge_descriptor
-        edge_descriptor;
 
       typedef typename boost::graph::parallel::process_group_type<DistributedGraph>
         ::type process_group_type;
diff --git a/include/boost/graph/distributed/connected_components_parallel_search.hpp b/include/boost/graph/distributed/connected_components_parallel_search.hpp
index e8b31f8..f3ebf05 100644
--- a/include/boost/graph/distributed/connected_components_parallel_search.hpp
+++ b/include/boost/graph/distributed/connected_components_parallel_search.hpp
@@ -290,8 +290,6 @@ namespace boost { namespace graph { namespace distributed {
     typedef typename boost::graph::parallel::process_group_type<Graph>
       ::type process_group_type;
     typedef typename process_group_type::process_id_type process_id_type;
-    typedef typename property_map<Graph, vertex_owner_t>
-      ::const_type vertex_owner_map;
     typedef std::queue<vertex_descriptor> work_queue;
 
     static const component_value_type max_component = 
diff --git a/include/boost/graph/distributed/crauser_et_al_shortest_paths.hpp b/include/boost/graph/distributed/crauser_et_al_shortest_paths.hpp
index e718501..060cbf9 100644
--- a/include/boost/graph/distributed/crauser_et_al_shortest_paths.hpp
+++ b/include/boost/graph/distributed/crauser_et_al_shortest_paths.hpp
@@ -540,13 +540,6 @@ crauser_et_al_shortest_paths
    Compare compare, Combine combine, DistInf inf, DistZero zero,
    DijkstraVisitor vis)
 {
-  typedef typename boost::graph::parallel::process_group_type<DistributedGraph>::type
-    process_group_type;
-  typedef typename process_group_type::process_id_type process_id_type;
-  typedef typename graph_traits<DistributedGraph>::vertex_descriptor
-    Vertex;
-  typedef typename graph_traits<DistributedGraph>::vertices_size_type
-    vertices_size_type;
 
 #ifdef PBGL_ACCOUNTING
   crauser_et_al_shortest_paths_stats.deleted_vertices.clear();
diff --git a/include/boost/graph/distributed/dehne_gotz_min_spanning_tree.hpp b/include/boost/graph/distributed/dehne_gotz_min_spanning_tree.hpp
index 4554dbb..0e7c1cf 100644
--- a/include/boost/graph/distributed/dehne_gotz_min_spanning_tree.hpp
+++ b/include/boost/graph/distributed/dehne_gotz_min_spanning_tree.hpp
@@ -642,7 +642,6 @@ merge_local_minimum_spanning_trees(const Graph& g, WeightMap weight,
   BOOST_STATIC_ASSERT((is_convertible<traversal_category*,
                                       vertex_list_graph_tag*>::value));
 
-  typedef typename graph_traits<Graph>::vertex_descriptor vertex_descriptor;
   typedef typename graph_traits<Graph>::edge_descriptor edge_descriptor;
 
   // Don't throw away cached edge weights
diff --git a/include/boost/graph/distributed/eager_dijkstra_shortest_paths.hpp b/include/boost/graph/distributed/eager_dijkstra_shortest_paths.hpp
index 8a2098f..8b78d63 100644
--- a/include/boost/graph/distributed/eager_dijkstra_shortest_paths.hpp
+++ b/include/boost/graph/distributed/eager_dijkstra_shortest_paths.hpp
@@ -349,13 +349,6 @@ eager_dijkstra_shortest_paths
    Compare compare, Combine combine, DistInf inf, DistZero zero,
    DijkstraVisitor vis)
 {
-  typedef typename boost::graph::parallel::process_group_type<DistributedGraph>::type
-    process_group_type;
-  typedef typename graph_traits<DistributedGraph>::vertex_descriptor
-    Vertex;
-  typedef typename graph_traits<DistributedGraph>::vertices_size_type
-    vertices_size_type;
-
 #ifdef PBGL_ACCOUNTING
   eager_dijkstra_shortest_paths_stats.deleted_vertices.clear();
   eager_dijkstra_shortest_paths_stats.lookahead = lookahead;
diff --git a/include/boost/graph/distributed/graphviz.hpp b/include/boost/graph/distributed/graphviz.hpp
index 5fb9580..fa843fd 100644
--- a/include/boost/graph/distributed/graphviz.hpp
+++ b/include/boost/graph/distributed/graphviz.hpp
@@ -106,10 +106,8 @@ write_graphviz(std::ostream& out,
                BOOST_GRAPH_ENABLE_IF_MODELS_PARM(Graph,distributed_graph_tag))
 {
   typedef typename graph_traits<Graph>::directed_category directed_category;
-  typedef typename graph_traits<Graph>::vertices_size_type vertices_size_type;
   typedef typename boost::graph::parallel::process_group_type<Graph>::type 
     process_group_type;
-  typedef typename process_group_type::process_id_type process_id_type;
   typedef typename property_map<Graph, vertex_index_t>::const_type
     VertexIndexMap;
   typedef typename property_map<Graph, vertex_global_t>::const_type
diff --git a/include/boost/graph/distributed/hohberg_biconnected_components.hpp b/include/boost/graph/distributed/hohberg_biconnected_components.hpp
index 9282dfe..9422aa0 100644
--- a/include/boost/graph/distributed/hohberg_biconnected_components.hpp
+++ b/include/boost/graph/distributed/hohberg_biconnected_components.hpp
@@ -912,7 +912,6 @@ hohberg_biconnected_components
   BOOST_CONCEPT_ASSERT(( IncidenceGraphConcept<Graph> ));
 
   typedef typename graph_traits<Graph>::edges_size_type edges_size_type;
-  typedef typename graph_traits<Graph>::degree_size_type degree_size_type;
   typedef typename graph_traits<Graph>::vertex_descriptor vertex_descriptor;
   typedef typename graph_traits<Graph>::edge_descriptor edge_descriptor;
 
@@ -942,7 +941,6 @@ hohberg_biconnected_components
   std::size_t path_length = 1;
 
   typedef std::vector<vertex_descriptor> path_t;
-  typedef typename path_t::iterator path_iterator;
 
   unsigned char minimum_phase = 5;
   do {
diff --git a/include/boost/graph/distributed/named_graph.hpp b/include/boost/graph/distributed/named_graph.hpp
index 48697cf..718b1e8 100644
--- a/include/boost/graph/distributed/named_graph.hpp
+++ b/include/boost/graph/distributed/named_graph.hpp
@@ -481,8 +481,6 @@ private:
 template<BGL_NAMED_GRAPH_PARAMS>
 BGL_NAMED_GRAPH::lazy_add_edge::~lazy_add_edge()
 {
-  typedef typename BGL_NAMED_GRAPH::process_id_type process_id_type;
-
   using boost::parallel::detail::make_untracked_pair;
 
   /// If this edge has already been created or will be created by
@@ -679,7 +677,6 @@ private:
 template<BGL_NAMED_GRAPH_PARAMS>
 BGL_NAMED_GRAPH::lazy_add_edge_with_property::~lazy_add_edge_with_property()
 {
-  typedef typename BGL_NAMED_GRAPH::process_id_type process_id_type;
   using boost::detail::parallel::make_pair_with_property;
 
   /// If this edge has already been created or will be created by
diff --git a/include/boost/graph/distributed/page_rank.hpp b/include/boost/graph/distributed/page_rank.hpp
index 1fc43ed..1db3b8a 100644
--- a/include/boost/graph/distributed/page_rank.hpp
+++ b/include/boost/graph/distributed/page_rank.hpp
@@ -89,8 +89,6 @@ page_rank_impl(const Graph& g, RankMap rank_map, Done done,
   int me;
   MPI_Comm_rank(MPI_COMM_WORLD, &me);
 
-  typedef typename property_map<Graph, vertex_owner_t>
-    ::const_type vertex_owner_map;
   typename property_map<Graph, vertex_owner_t>::const_type
     owner = get(vertex_owner, g);
   (void)owner;
diff --git a/include/boost/graph/distributed/strong_components.hpp b/include/boost/graph/distributed/strong_components.hpp
index 16d61af..5c9307f 100644
--- a/include/boost/graph/distributed/strong_components.hpp
+++ b/include/boost/graph/distributed/strong_components.hpp
@@ -70,8 +70,6 @@ void
 marshal_set( std::vector<std::vector<typename graph_traits<Graph>::vertex_descriptor> > in,
              std::vector<typename graph_traits<Graph>::vertex_descriptor>& out )
 {
-  typedef typename graph_traits<Graph>::vertex_descriptor vertex_descriptor;
-
   for( std::size_t i = 0; i < in.size(); ++i ) {
     out.insert( out.end(), graph_traits<Graph>::null_vertex() );
     out.insert( out.end(), in[i].begin(), in[i].end() );
@@ -85,7 +83,6 @@ unmarshal_set( std::vector<typename graph_traits<Graph>::vertex_descriptor> in,
                std::vector<std::vector<typename graph_traits<Graph>::vertex_descriptor> >& out )
 {
   typedef typename graph_traits<Graph>::vertex_descriptor vertex_descriptor;
-  typedef typename graph_traits<Graph>::vertex_iterator vertex_iterator;
 
   while( !in.empty() ) {
     typename std::vector<vertex_descriptor>::iterator end 
@@ -732,8 +729,6 @@ namespace boost { namespace graph { namespace distributed {
       typedef typename process_group_type::process_id_type process_id_type;
       typedef std::vector<std::pair<vertex_descriptor, vertex_descriptor> > VertexPairVec;
 
-      typedef typename graph_traits<Graph>::directed_category directed_category;
-
       typename property_map<Graph, vertex_owner_t>::const_type
         owner = get(vertex_owner, g);
 
@@ -862,7 +857,6 @@ namespace boost { namespace graph { namespace distributed {
        VertexIndexMap vertex_index_map,
        incidence_graph_tag)
     {
-      typedef typename graph_traits<Graph>::vertex_iterator vertex_iterator;
       typedef typename graph_traits<Graph>::vertex_descriptor vertex_descriptor;
       typedef iterator_property_map<typename std::vector<vertex_descriptor>::iterator,
                                     VertexIndexMap> IsoMap;
diff --git a/test/adjlist_redist_test.cpp b/test/adjlist_redist_test.cpp
index a2e188a..592ca68 100644
--- a/test/adjlist_redist_test.cpp
+++ b/test/adjlist_redist_test.cpp
@@ -107,7 +107,6 @@ double get_mst_weight (const Graph& g)
 template<typename Graph>
 void test_redistribution(int n, double p, int iterations, bool debug_output)
 {
-  typedef typename graph_traits<Graph>::edge_descriptor edge_descriptor;
   RandomGenerator gen;
   Graph g(erdos_renyi_iterator<RandomGenerator, Graph>(gen, n, p),
           erdos_renyi_iterator<RandomGenerator, Graph>(),
diff --git a/test/adjlist_remove_test.cpp b/test/adjlist_remove_test.cpp
index f4f7339..549c519 100644
--- a/test/adjlist_remove_test.cpp
+++ b/test/adjlist_remove_test.cpp
@@ -34,7 +34,6 @@ void test_bidirectional_graph()
   typedef adjacency_list<listS, distributedS<mpi_process_group, vecS>,
                          bidirectionalS> Graph;
   typedef graph_traits<Graph>::vertex_descriptor Vertex;
-  typedef graph_traits<Graph>::edge_descriptor Edge;
 
   typedef std::pair<std::size_t, std::size_t> E;
   E edges[3] = { E(0,3), E(1,4), E(2,5) };
diff --git a/test/distributed_betweenness_centrality_test.cpp b/test/distributed_betweenness_centrality_test.cpp
index 373ac9c..90c9314 100644
--- a/test/distributed_betweenness_centrality_test.cpp
+++ b/test/distributed_betweenness_centrality_test.cpp
@@ -131,9 +131,6 @@ int test_main(int argc, char* argv[])
 
   typedef sorted_erdos_renyi_iterator<minstd_rand, Graph> ERIter;
 
-  typedef graph_traits<Graph>::vertex_descriptor vertex_descriptor;
-  typedef graph_traits<Graph>::edge_descriptor edge_descriptor;
-
   int n = 100;
   double prob = 0.1;
   int C = 3;
diff --git a/test/distributed_connected_components_test.cpp b/test/distributed_connected_components_test.cpp
index 68ba53c..feb9ee7 100644
--- a/test/distributed_connected_components_test.cpp
+++ b/test/distributed_connected_components_test.cpp
@@ -72,11 +72,6 @@ test_distributed_connected_components(int n, double _p, bool verify, bool emit_d
   typedef compressed_sparse_row_graph<directedS, no_property, no_property, no_property,
                                       distributedS<mpi_process_group> > Graph;
 
-  typedef graph_traits<Graph>::vertex_descriptor vertex_descriptor;
-  typedef graph_traits<Graph>::vertex_iterator vertex_iterator;
-  typedef iterator_property_map<std::vector<vertex_descriptor>::iterator, property_map<Graph, vertex_index_t>::type> ParentMap;
-  typedef std::pair<int, int> Edge;
-
   minstd_rand gen;
 
   gen.seed(seed);
diff --git a/test/distributed_csr_algorithm_test.cpp b/test/distributed_csr_algorithm_test.cpp
index fffb947..0653cc9 100644
--- a/test/distributed_csr_algorithm_test.cpp
+++ b/test/distributed_csr_algorithm_test.cpp
@@ -224,7 +224,6 @@ int test_main(int argc, char* argv[])
   typedef small_world_iterator<minstd_rand, Digraph> SWIter;
   typedef sorted_rmat_iterator<minstd_rand, Digraph> RMATIter;
 
-  typedef graph_traits<Digraph>::vertex_descriptor vertex_descriptor;
   typedef graph_traits<Digraph>::edge_descriptor edge_descriptor;
 
   int n = 40;
diff --git a/test/distributed_csr_test.cpp b/test/distributed_csr_test.cpp
index d28755b..a3daada 100644
--- a/test/distributed_csr_test.cpp
+++ b/test/distributed_csr_test.cpp
@@ -35,7 +35,7 @@ using boost::graph::distributed::mpi_process_group;
 
 void concept_checks()
 {
-  typedef compressed_sparse_row_graph<directedS, void, void, no_property, 
+  typedef compressed_sparse_row_graph<directedS, no_property, no_property, no_property, 
                                       distributedS<mpi_process_group> >
     Digraph;
   typedef graph_traits<Digraph>::vertex_descriptor vertex_descriptor;
@@ -81,7 +81,7 @@ int test_main(int argc, char* argv[])
 
   concept_checks();
 
-  typedef compressed_sparse_row_graph<directedS, void, void, no_property, 
+  typedef compressed_sparse_row_graph<directedS, no_property, no_property, no_property, 
                                       distributedS<mpi_process_group> >
     Digraph;
 
diff --git a/test/distributed_dfs_test.cpp b/test/distributed_dfs_test.cpp
index 04c73b6..9c31730 100644
--- a/test/distributed_dfs_test.cpp
+++ b/test/distributed_dfs_test.cpp
@@ -118,7 +118,6 @@ test_distributed_dfs()
                          // Vertex properties
                          property<vertex_color_t, default_color_type> >
     Graph;
-  typedef graph_traits<Graph>::vertices_size_type size_type;
   typedef graph_traits<Graph>::vertex_descriptor vertex_descriptor;
 
   // Specify the edges in the graph
diff --git a/test/distributed_graph_coloring_test.cpp b/test/distributed_graph_coloring_test.cpp
index 147a62b..e37e196 100644
--- a/test/distributed_graph_coloring_test.cpp
+++ b/test/distributed_graph_coloring_test.cpp
@@ -42,8 +42,6 @@ test_distributed_graph_coloring(int n, double p, int s,
                          distributedS<mpi_process_group, vecS>,
                          undirectedS> Graph;
 
-  typedef graph_traits<Graph>::vertex_descriptor vertex_descriptor;
-  typedef graph_traits<Graph>::vertex_iterator vertex_iterator;
   typedef property_map<Graph, vertex_index_t>::type vertex_index_map;
 
   // Build a random number generator
diff --git a/test/distributed_mst_test.cpp b/test/distributed_mst_test.cpp
index 18a417c..41e8830 100644
--- a/test/distributed_mst_test.cpp
+++ b/test/distributed_mst_test.cpp
@@ -65,8 +65,6 @@ test_distributed_dense_boruvka()
                          // Edge properties
                          property<edge_weight_t, int> > Graph;
 
-  typedef graph_traits<Graph>::vertex_descriptor vertex_descriptor;
-  typedef graph_traits<Graph>::vertex_iterator vertex_iterator;
   typedef graph_traits<Graph>::edge_descriptor edge_descriptor;
 
   typedef std::pair<int, int> E;
diff --git a/test/distributed_shortest_paths_test.cpp b/test/distributed_shortest_paths_test.cpp
index 7f89797..fce4c25 100644
--- a/test/distributed_shortest_paths_test.cpp
+++ b/test/distributed_shortest_paths_test.cpp
@@ -169,10 +169,7 @@ test_distributed_shortest_paths(int n, double p, int c, int seed)
                          VertexProperties,
                          WeightedEdge> Graph;
 
-  typedef graph_traits<Graph>::vertex_descriptor vertex_descriptor;
-  typedef graph_traits<Graph>::vertex_iterator vertex_iterator;
   typedef graph_traits<Graph>::vertices_size_type vertices_size_type;
-  typedef property_map<Graph, vertex_index_t>::type vertex_index_map;
 
   // Build a random number generator
   minstd_rand gen;
diff --git a/test/distributed_st_connected_test.cpp b/test/distributed_st_connected_test.cpp
index fc27ee0..a65f404 100644
--- a/test/distributed_st_connected_test.cpp
+++ b/test/distributed_st_connected_test.cpp
@@ -48,8 +48,6 @@ test_distributed_st_connected() {
                          // Vertex properties
                          property<vertex_color_t, default_color_type> >
     Graph;
-  typedef graph_traits<Graph>::vertices_size_type size_type;
-  typedef graph_traits<Graph>::vertex_descriptor vertex_descriptor;
 
   // Specify the edges in the graph
   {
diff --git a/test/distributed_strong_components_test.cpp b/test/distributed_strong_components_test.cpp
index b55daf9..cbbd41b 100644
--- a/test/distributed_strong_components_test.cpp
+++ b/test/distributed_strong_components_test.cpp
@@ -75,11 +75,6 @@ test_distributed_strong_components(int n, double _p, bool verify, bool emit_dot_
                          bidirectionalS > Graph;
 #endif
 
-  typedef graph_traits<Graph>::vertex_descriptor vertex_descriptor;
-  typedef graph_traits<Graph>::vertex_iterator vertex_iterator;
-  typedef iterator_property_map<std::vector<vertex_descriptor>::iterator, property_map<Graph, vertex_index_t>::type> ParentMap;
-  typedef std::pair<int, int> Edge;
-
   minstd_rand gen;
 
   gen.seed(seed);