diff --git a/include/boost/graph/adj_list_serialize.hpp b/include/boost/graph/adj_list_serialize.hpp
index 85f7e2ed4..66d5bd443 100644
--- a/include/boost/graph/adj_list_serialize.hpp
+++ b/include/boost/graph/adj_list_serialize.hpp
@@ -43,17 +43,17 @@ namespace serialization
         const unsigned int /* file_version */
     )
     {
-        typedef adjacency_list< OEL, VL, D, VP, EP, GP, EL > Graph;
-        typedef typename graph_traits< Graph >::vertex_descriptor Vertex;
+        using Graph = adjacency_list< OEL, VL, D, VP, EP, GP, EL >;
+        using Vertex = typename graph_traits< Graph >::vertex_descriptor;
 
-        int V = num_vertices(graph);
-        int E = num_edges(graph);
+        const auto V = num_vertices(graph);
+        const auto E = num_edges(graph);
         ar << BOOST_SERIALIZATION_NVP(V);
         ar << BOOST_SERIALIZATION_NVP(E);
 
         // assign indices to vertices
-        std::map< Vertex, int > indices;
-        int num = 0;
+        std::map< Vertex, size_t > indices;
+        size_t num = 0;
         BGL_FORALL_VERTICES_T(v, graph, Graph)
         {
             indices[v] = num++;
@@ -81,9 +81,9 @@ namespace serialization
         const unsigned int /* file_version */
     )
     {
-        typedef adjacency_list< OEL, VL, D, VP, EP, GP, EL > Graph;
-        typedef typename graph_traits< Graph >::vertex_descriptor Vertex;
-        typedef typename graph_traits< Graph >::edge_descriptor Edge;
+        using Graph = adjacency_list< OEL, VL, D, VP, EP, GP, EL >;
+        using Vertex = typename graph_traits< Graph >::vertex_descriptor;
+        using Edge = typename graph_traits< Graph >::edge_descriptor;
 
         unsigned int V;
         ar >> BOOST_SERIALIZATION_NVP(V);
@@ -91,7 +91,7 @@ namespace serialization
         ar >> BOOST_SERIALIZATION_NVP(E);
 
         std::vector< Vertex > verts(V);
-        int i = 0;
+        size_t i = 0;
         while (V-- > 0)
         {
             Vertex v = add_vertex(graph);
@@ -101,13 +101,14 @@ namespace serialization
         }
         while (E-- > 0)
         {
-            int u;
-            int v;
+            Vertex u;
+            Vertex v;
             ar >> BOOST_SERIALIZATION_NVP(u);
             ar >> BOOST_SERIALIZATION_NVP(v);
+            
             Edge e;
             bool inserted;
-            boost::tie(e, inserted) = add_edge(verts[u], verts[v], graph);
+            boost::tie(e, inserted)= add_edge(verts[u], verts[v], graph);
             ar >> serialization::make_nvp(
                 "edge_property", get(edge_all_t(), graph, e));
         }