From 086a94c8a5c1fd5d755fb8968135445832ec99b6 Mon Sep 17 00:00:00 2001 From: Jeremiah Willcock Date: Sun, 5 Dec 2010 20:17:48 +0000 Subject: [PATCH] Applied patch from Matthias Walter [SVN r67031] --- include/boost/graph/bipartite.hpp | 4 ---- 1 file changed, 4 deletions(-) diff --git a/include/boost/graph/bipartite.hpp b/include/boost/graph/bipartite.hpp index f902fd3e..b917c607 100644 --- a/include/boost/graph/bipartite.hpp +++ b/include/boost/graph/bipartite.hpp @@ -212,8 +212,6 @@ namespace boost { depth_first_search (graph, vertex_index_map (index_map).visitor (make_dfs_visitor (std::make_pair ( detail::colorize_bipartition (partition_map), std::make_pair (detail::check_bipartition (partition_map), put_property (partition_map, color_traits ::white (), on_start_vertex ())))))); - - // depth_first_search (graph, vertex_index_map (index_map).visitor (dfs_visitor)); } catch (detail::bipartite_visitor_error error) { @@ -284,11 +282,9 @@ namespace boost { typedef std::vector predecessors_t; typedef iterator_property_map predecessor_map_t; - typedef predecessor_recorder predecessor_recorder_t; predecessors_t predecessors (num_vertices (graph), graph_traits ::null_vertex ()); predecessor_map_t predecessor_map (predecessors.begin (), index_map); - predecessor_recorder_t predecessor_recorder (predecessor_map); /// Initialize predecessor map for (boost::tie (vertex_iter, vertex_end) = vertices (graph); vertex_iter != vertex_end; ++vertex_iter)