From 397ddb31eae6f0093d8d0121b353e34b77fc7b61 Mon Sep 17 00:00:00 2001
From: Jeremy Siek <jeremy.siek@gmail.com>
Date: Tue, 20 Aug 2002 15:54:39 +0000
Subject: [PATCH] blah

[SVN r14995]
---
 include/boost/graph/graph_test.hpp | 6 ++----
 1 file changed, 2 insertions(+), 4 deletions(-)

diff --git a/include/boost/graph/graph_test.hpp b/include/boost/graph/graph_test.hpp
index e9dac737..04bfef53 100644
--- a/include/boost/graph/graph_test.hpp
+++ b/include/boost/graph/graph_test.hpp
@@ -143,8 +143,7 @@ namespace boost {
       typedef typename graph_traits<Graph>::vertex_iterator v_iter;
       std::pair<v_iter, v_iter> p = vertices(g);
       BOOST_TEST(num_vertices(g) == vertex_set.size());
-      v_size_t n = 0;
-      std::distance(p.first, p.second, n);
+      v_size_t n = std::distance(p.first, p.second);
       BOOST_TEST(n == num_vertices(g));
       for (; p.first != p.second; ++p.first) {
         vertex_t v = *p.first;
@@ -160,8 +159,7 @@ namespace boost {
       typedef typename graph_traits<Graph>::edge_iterator e_iter;
       std::pair<e_iter, e_iter> p = edges(g);
       BOOST_TEST(num_edges(g) == edge_set.size());
-      e_size_t m = 0;
-      std::distance(p.first, p.second, m);
+      e_size_t m = std::distance(p.first, p.second);
       BOOST_TEST(m == num_edges(g));
       for (; p.first != p.second; ++p.first) {
         edge_t e = *p.first;