Boost Graph Library: Depth-First Search

Only in .: INSTALL Only in .: Jamroot Only in .: LICENSE_1_0.txt Only in ./boost: accumulators Only in ./boost: algorithm Only in ./boost: aligned_storage.hpp Only in ./boost: any.hpp Only in ./boost: archive Only in ./boost: array.hpp Only in ./boost: asio Only in ./boost: asio.hpp Only in ./boost: assert.hpp Only in ./boost: assign Only in ./boost: assign.hpp Only in ./boost: bimap Only in ./boost: bimap.hpp Only in ./boost: bind Only in ./boost: bind.hpp Only in ./boost: blank.hpp Only in ./boost: blank_fwd.hpp Only in ./boost: call_traits.hpp Only in ./boost: cast.hpp Only in ./boost: cerrno.hpp Only in ./boost: checked_delete.hpp Only in ./boost: circular_buffer Only in ./boost: circular_buffer.hpp Only in ./boost: circular_buffer_fwd.hpp Only in ./boost: compatibility Only in ./boost: compressed_pair.hpp Only in ./boost: concept Only in ./boost: concept_archetype.hpp Only in ./boost: concept_check Only in ./boost: concept_check.hpp Only in ./boost: config Only in ./boost: config.hpp Only in ./boost: crc.hpp Only in ./boost: cregex.hpp Only in ./boost: cstdint.hpp Only in ./boost: cstdlib.hpp Only in ./boost: current_function.hpp Only in ./boost: date_time Only in ./boost: date_time.hpp Only in ./boost: detail Only in ./boost: dynamic_bitset Only in ./boost: dynamic_bitset.hpp Only in ./boost: dynamic_bitset_fwd.hpp Only in ./boost: enable_shared_from_this.hpp Only in ./boost: exception Only in ./boost: exception.hpp Only in ./boost: exception_ptr.hpp Only in ./boost: filesystem Only in ./boost: filesystem.hpp Only in ./boost: flyweight Only in ./boost: flyweight.hpp Only in ./boost: foreach.hpp Only in ./boost: foreach_fwd.hpp Only in ./boost: format Only in ./boost: format.hpp Only in ./boost: function Only in ./boost: function.hpp Only in ./boost: function_equal.hpp Only in ./boost: function_output_iterator.hpp Only in ./boost: function_types Only in ./boost: functional Only in ./boost: functional.hpp Only in ./boost: fusion Only in ./boost: generator_iterator.hpp Only in ./boost: get_pointer.hpp Only in ./boost: gil Only in ./boost/graph: accounting.hpp Only in ./boost/graph: adj_list_serialize.hpp Only in ./boost/graph: adjacency_iterator.hpp Only in ./boost/graph: adjacency_list.hpp Only in ./boost/graph: adjacency_list_io.hpp Only in ./boost/graph: adjacency_matrix.hpp Only in ./boost/graph: astar_search.hpp Only in ./boost/graph: bandwidth.hpp Only in ./boost/graph: bc_clustering.hpp Only in ./boost/graph: bellman_ford_shortest_paths.hpp Only in ./boost/graph: betweenness_centrality.hpp Only in ./boost/graph: biconnected_components.hpp Only in ./boost/graph: bipartite.hpp Only in ./boost/graph: boyer_myrvold_planar_test.hpp Only in ./boost/graph: boykov_kolmogorov_max_flow.hpp Only in ./boost/graph: breadth_first_search.hpp Only in ./boost/graph: bron_kerbosch_all_cliques.hpp Only in ./boost/graph: buffer_concepts.hpp Only in ./boost/graph: chrobak_payne_drawing.hpp Only in ./boost/graph: circle_layout.hpp Only in ./boost/graph: closeness_centrality.hpp Only in ./boost/graph: clustering_coefficient.hpp Only in ./boost/graph: compressed_sparse_row_graph.hpp Only in ./boost/graph: connected_components.hpp Only in ./boost/graph: copy.hpp Only in ./boost/graph: core_numbers.hpp Only in ./boost/graph: create_condensation_graph.hpp Only in ./boost/graph: cuthill_mckee_ordering.hpp Only in ./boost/graph: dag_shortest_paths.hpp Only in ./boost/graph: degree_centrality.hpp diff --recursive --unified ./boost/graph/depth_first_search.hpp ../../Libdev/boost-graph-dfs/boost/graph/depth_first_search.hpp --- ./boost/graph/depth_first_search.hpp 2010-07-05 11:48:17.000000000 -0400 +++ ../../Libdev/boost-graph-dfs/boost/graph/depth_first_search.hpp 2011-03-05 15:14:49.000000000 -0500 @@ -39,6 +39,7 @@ vis.tree_edge(e, g); vis.back_edge(e, g); vis.forward_or_cross_edge(e, g); + vis.finish_edge(e, g); vis.finish_vertex(u, g); } private: @@ -77,7 +78,7 @@ void depth_first_visit_impl (const IncidenceGraph& g, typename graph_traits::vertex_descriptor u, - DFSVisitor& vis, + DFSVisitor& vis, // pass-by-reference here, important! ColorMap color, TerminatorFunc func = TerminatorFunc()) { function_requires >(); @@ -88,7 +89,7 @@ function_requires< ColorValueConcept >(); typedef color_traits Color; typedef typename graph_traits::out_edge_iterator Iter; - typedef std::pair > VertexInfo; + typedef std::pair VertexInfo; Iter ei, ei_end; std::vector stack; @@ -98,46 +99,39 @@ typedef typename unwrap_reference::type TF; - put(color, u, Color::gray()); - vis.discover_vertex(u, g); - boost::tie(ei, ei_end) = out_edges(u, g); + put(color, u, Color::gray()); vis.discover_vertex(u, g); // Variable is needed to workaround a borland bug. TF& fn = static_cast(func); if (fn(u, g)) { - // If this vertex terminates the search, we push empty range - stack.push_back(std::make_pair(u, std::make_pair(ei_end, ei_end))); - } else { - stack.push_back(std::make_pair(u, std::make_pair(ei, ei_end))); + put(color, u, Color::black()); vis.finish_vertex(u, g); + return; } - while (!stack.empty()) { - VertexInfo& back = stack.back(); - u = back.first; - boost::tie(ei, ei_end) = back.second; - stack.pop_back(); - while (ei != ei_end) { + + for (tie(ei, ei_end) = out_edges(u, g); ; ++ei) { + while (ei != ei_end) { vis.examine_edge(*ei, g); Vertex v = target(*ei, g); - vis.examine_edge(*ei, g); ColorValue v_color = get(color, v); - if (v_color == Color::white()) { - vis.tree_edge(*ei, g); - stack.push_back(std::make_pair(u, std::make_pair(++ei, ei_end))); + if (v_color == Color::white()) { vis.tree_edge(*ei, g); + stack.push_back(VertexInfo(ei, ei_end)); u = v; - put(color, u, Color::gray()); - vis.discover_vertex(u, g); - boost::tie(ei, ei_end) = out_edges(u, g); + put(color, u, Color::gray()); vis.discover_vertex(u, g); if (fn(u, g)) { - ei = ei_end; + ei = ei_end; + } else { + tie(ei, ei_end) = out_edges(u, g); } - } else if (v_color == Color::gray()) { - vis.back_edge(*ei, g); - ++ei; } else { - vis.forward_or_cross_edge(*ei, g); + if (v_color == Color::gray()) vis.back_edge(*ei, g); + else vis.forward_or_cross_edge(*ei, g); + vis.finish_edge(*ei, g); ++ei; } } - put(color, u, Color::black()); - vis.finish_vertex(u, g); + put(color, u, Color::black()); vis.finish_vertex(u, g); + if (stack.empty()) break; + tie(ei, ei_end) = stack.back(); + u = source(*ei, g); + stack.pop_back(); vis.finish_edge(*ei, g); } } @@ -173,6 +167,7 @@ depth_first_visit_impl(g, v, vis, color, func); } else if (v_color == Color::gray()) vis.back_edge(*ei, g); else vis.forward_or_cross_edge(*ei, g); + vis.finish_edge(*ei, g); } put(color, u, Color::black()); vis.finish_vertex(u, g); } @@ -257,6 +252,10 @@ void forward_or_cross_edge(Edge u, const Graph& g) { invoke_visitors(m_vis, u, g, ::boost::on_forward_or_cross_edge()); } + template + void finish_edge(Edge u, const Graph& g) { + invoke_visitors(m_vis, u, g, ::boost::on_finish_edge()); + } template void finish_vertex(Vertex u, const Graph& g) { invoke_visitors(m_vis, u, g, ::boost::on_finish_vertex()); @@ -269,6 +268,7 @@ BOOST_GRAPH_EVENT_STUB(on_tree_edge,dfs) BOOST_GRAPH_EVENT_STUB(on_back_edge,dfs) BOOST_GRAPH_EVENT_STUB(on_forward_or_cross_edge,dfs) + BOOST_GRAPH_EVENT_STUB(on_finish_edge,dfs) BOOST_GRAPH_EVENT_STUB(on_finish_vertex,dfs) protected: Only in ./boost/graph: detail Only in ./boost/graph: dijkstra_shortest_paths.hpp Only in ./boost/graph: dijkstra_shortest_paths_no_color_map.hpp Only in ./boost/graph: dimacs.hpp Only in ./boost/graph: directed_graph.hpp Only in ./boost/graph: distributed Only in ./boost/graph: dll_import_export.hpp Only in ./boost/graph: dominator_tree.hpp Only in ./boost/graph: eccentricity.hpp Only in ./boost/graph: edge_connectivity.hpp Only in ./boost/graph: edge_list.hpp Only in ./boost/graph: edmonds_karp_max_flow.hpp Only in ./boost/graph: edmunds_karp_max_flow.hpp Only in ./boost/graph: erdos_renyi_generator.hpp Only in ./boost/graph: exception.hpp Only in ./boost/graph: exterior_property.hpp Only in ./boost/graph: filtered_graph.hpp Only in ./boost/graph: floyd_warshall_shortest.hpp Only in ./boost/graph: fruchterman_reingold.hpp Only in ./boost/graph: geodesic_distance.hpp Only in ./boost/graph: graph_archetypes.hpp Only in ./boost/graph: graph_as_tree.hpp Only in ./boost/graph: graph_concepts.hpp Only in ./boost/graph: graph_mutability_traits.hpp Only in ./boost/graph: graph_selectors.hpp Only in ./boost/graph: graph_stats.hpp Only in ./boost/graph: graph_test.hpp Only in ./boost/graph: graph_traits.hpp Only in ./boost/graph: graph_utility.hpp Only in ./boost/graph: graphml.hpp Only in ./boost/graph: graphviz.hpp Only in ./boost/graph: grid_graph.hpp Only in ./boost/graph: gursoy_atun_layout.hpp Only in ./boost/graph: howard_cycle_ratio.hpp Only in ./boost/graph: incremental_components.hpp Only in ./boost/graph: is_kuratowski_subgraph.hpp Only in ./boost/graph: is_straight_line_drawing.hpp Only in ./boost/graph: isomorphism.hpp Only in ./boost/graph: iteration_macros.hpp Only in ./boost/graph: iteration_macros_undef.hpp Only in ./boost/graph: johnson_all_pairs_shortest.hpp Only in ./boost/graph: kamada_kawai_spring_layout.hpp Only in ./boost/graph: king_ordering.hpp Only in ./boost/graph: kolmogorov_max_flow.hpp Only in ./boost/graph: kruskal_min_spanning_tree.hpp Only in ./boost/graph: labeled_graph.hpp Only in ./boost/graph: leda_graph.hpp Only in ./boost/graph: lookup_edge.hpp Only in ./boost/graph: loop_erased_random_walk.hpp Only in ./boost/graph: make_biconnected_planar.hpp Only in ./boost/graph: make_connected.hpp Only in ./boost/graph: make_maximal_planar.hpp Only in ./boost/graph: matrix_as_graph.hpp Only in ./boost/graph: max_cardinality_matching.hpp Only in ./boost/graph: mcgregor_common_subgraphs.hpp Only in ./boost/graph: mesh_graph_generator.hpp Only in ./boost/graph: metis.hpp Only in ./boost/graph: metric_tsp_approx.hpp Only in ./boost/graph: minimum_degree_ordering.hpp Only in ./boost/graph: named_function_params.hpp Only in ./boost/graph: named_graph.hpp Only in ./boost/graph: neighbor_bfs.hpp Only in ./boost/graph: numeric_values.hpp Only in ./boost/graph: one_bit_color_map.hpp Only in ./boost/graph: overloading.hpp Only in ./boost/graph: page_rank.hpp Only in ./boost/graph: parallel Only in ./boost/graph: planar_canonical_ordering.hpp Only in ./boost/graph: planar_detail Only in ./boost/graph: planar_face_traversal.hpp Only in ./boost/graph: plod_generator.hpp Only in ./boost/graph: point_traits.hpp Only in ./boost/graph: prim_minimum_spanning_tree.hpp Only in ./boost/graph: profile.hpp Only in ./boost/graph: properties.hpp Only in ./boost/graph: property_iter_range.hpp Only in ./boost/graph: property_maps Only in ./boost/graph: push_relabel_max_flow.hpp Only in ./boost/graph: r_c_shortest_paths.hpp Only in ./boost/graph: random.hpp Only in ./boost/graph: random_layout.hpp Only in ./boost/graph: random_spanning_tree.hpp Only in ./boost/graph: read_dimacs.hpp Only in ./boost/graph: relax.hpp Only in ./boost/graph: reverse_graph.hpp Only in ./boost/graph: rmat_graph_generator.hpp Only in ./boost/graph: sequential_vertex_coloring.hpp Only in ./boost/graph: simple_point.hpp Only in ./boost/graph: sloan_ordering.hpp Only in ./boost/graph: small_world_generator.hpp Only in ./boost/graph: smallest_last_ordering.hpp Only in ./boost/graph: ssca_graph_generator.hpp Only in ./boost/graph: st_connected.hpp Only in ./boost/graph: stanford_graph.hpp Only in ./boost/graph: stoer_wagner_min_cut.hpp Only in ./boost/graph: strong_components.hpp Only in ./boost/graph: subgraph.hpp Only in ./boost/graph: tiernan_all_cycles.hpp Only in ./boost/graph: topological_sort.hpp Only in ./boost/graph: topology.hpp Only in ./boost/graph: transitive_closure.hpp Only in ./boost/graph: transitive_reduction.hpp Only in ./boost/graph: transpose_graph.hpp Only in ./boost/graph: tree_traits.hpp Only in ./boost/graph: two_bit_color_map.hpp diff --recursive --unified ./boost/graph/undirected_dfs.hpp ../../Libdev/boost-graph-dfs/boost/graph/undirected_dfs.hpp --- ./boost/graph/undirected_dfs.hpp 2010-07-03 14:37:39.000000000 -0400 +++ ../../Libdev/boost-graph-dfs/boost/graph/undirected_dfs.hpp 2011-03-05 14:18:34.000000000 -0500 @@ -28,7 +28,7 @@ void undir_dfv_impl (const IncidenceGraph& g, typename graph_traits::vertex_descriptor u, - DFSVisitor& vis, + DFSVisitor& vis, // pass-by-reference here, important! VertexColorMap vertex_color, EdgeColorMap edge_color) { @@ -45,41 +45,35 @@ typedef color_traits Color; typedef color_traits EColor; typedef typename graph_traits::out_edge_iterator Iter; - typedef std::pair > VertexInfo; + typedef std::pair VertexInfo; + Iter ei, ei_end; std::vector stack; - put(vertex_color, u, Color::gray()); - vis.discover_vertex(u, g); - stack.push_back(std::make_pair(u, out_edges(u, g))); - while (!stack.empty()) { - VertexInfo& back = stack.back(); - u = back.first; - Iter ei, ei_end; - boost::tie(ei, ei_end) = back.second; - stack.pop_back(); - while (ei != ei_end) { + put(vertex_color, u, Color::gray()); vis.discover_vertex(u, g); + for (tie(ei, ei_end) = out_edges(u, g); ; ++ei) { + while (ei != ei_end) { vis.examine_edge(*ei, g); Vertex v = target(*ei, g); - vis.examine_edge(*ei, g); ColorValue v_color = get(vertex_color, v); EColorValue uv_color = get(edge_color, *ei); put(edge_color, *ei, EColor::black()); - if (v_color == Color::white()) { - vis.tree_edge(*ei, g); - stack.push_back(std::make_pair(u, std::make_pair(++ei, ei_end))); + if (v_color == Color::white()) { vis.tree_edge(*ei, g); + stack.push_back(VertexInfo(ei, ei_end)); u = v; - put(vertex_color, u, Color::gray()); - vis.discover_vertex(u, g); - boost::tie(ei, ei_end) = out_edges(u, g); - } else if (v_color == Color::gray()) { - if (uv_color == EColor::white()) vis.back_edge(*ei, g); - ++ei; - } else { // if (v_color == Color::black()) + put(vertex_color, u, Color::gray()); vis.discover_vertex(u, g); + tie(ei, ei_end) = out_edges(u, g); + } else { + if ((v_color == Color::gray()) && (uv_color == EColor::white())) + vis.back_edge(*ei, g); + vis.finish_edge(*ei, g); ++ei; } } - put(vertex_color, u, Color::black()); - vis.finish_vertex(u, g); + put(vertex_color, u, Color::black()); vis.finish_vertex(u, g); + if (stack.empty()) break; + tie(ei, ei_end) = stack.back(); + u = source(*ei, g); + stack.pop_back(); vis.finish_edge(*ei, g); } } @@ -118,6 +112,7 @@ undir_dfv_impl(g, v, vis, vertex_color, edge_color); } else if (v_color == Color::gray() && uv_color == EColor::white()) vis.back_edge(*ei, g); + vis.finish_edge(*ei, g); } put(vertex_color, u, Color::black()); vis.finish_vertex(u, g); } Only in ./boost/graph: undirected_graph.hpp Only in ./boost/graph: use_mpi.hpp Only in ./boost/graph: vector_as_graph.hpp Only in ./boost/graph: vertex_and_edge_range.hpp diff --recursive --unified ./boost/graph/visitors.hpp ../../Libdev/boost-graph-dfs/boost/graph/visitors.hpp --- ./boost/graph/visitors.hpp 2010-04-02 11:25:11.000000000 -0400 +++ ../../Libdev/boost-graph-dfs/boost/graph/visitors.hpp 2011-03-05 14:11:00.000000000 -0500 @@ -44,7 +44,7 @@ on_discover_vertex_num, on_finish_vertex_num, on_examine_vertex_num, on_examine_edge_num, on_tree_edge_num, on_non_tree_edge_num, on_gray_target_num, on_black_target_num, - on_forward_or_cross_edge_num, on_back_edge_num, + on_forward_or_cross_edge_num, on_back_edge_num, on_finish_edge_num, on_edge_relaxed_num, on_edge_not_relaxed_num, on_edge_minimized_num, on_edge_not_minimized_num }; @@ -75,6 +75,7 @@ struct on_forward_or_cross_edge { enum { num = detail::on_forward_or_cross_edge_num }; }; struct on_back_edge { enum { num = detail::on_back_edge_num }; }; + struct on_finish_edge { enum { num = detail::on_finish_edge_num }; }; struct on_edge_relaxed { enum { num = detail::on_edge_relaxed_num }; }; struct on_edge_not_relaxed { Only in ./boost/graph: wavefront.hpp Only in ./boost/graph: write_dimacs.hpp Only in ./boost: icl Only in ./boost: implicit_cast.hpp Only in ./boost: indirect_reference.hpp Only in ./boost: integer Only in ./boost: integer.hpp Only in ./boost: integer_fwd.hpp Only in ./boost: integer_traits.hpp Only in ./boost: interprocess Only in ./boost: intrusive Only in ./boost: intrusive_ptr.hpp Only in ./boost: io Only in ./boost: io_fwd.hpp Only in ./boost: iostreams Only in ./boost: is_placeholder.hpp Only in ./boost: iterator Only in ./boost: iterator.hpp Only in ./boost: iterator_adaptors.hpp Only in ./boost: lambda Only in ./boost: last_value.hpp Only in ./boost: lexical_cast.hpp Only in ./boost: limits.hpp Only in ./boost: logic Only in ./boost: make_shared.hpp Only in ./boost: math Only in ./boost: math_fwd.hpp Only in ./boost: mem_fn.hpp Only in ./boost: memory_order.hpp Only in ./boost: mpi Only in ./boost: mpi.hpp Only in ./boost: mpl Only in ./boost: msm Only in ./boost: multi_array Only in ./boost: multi_array.hpp Only in ./boost: multi_index Only in ./boost: multi_index_container.hpp Only in ./boost: multi_index_container_fwd.hpp Only in ./boost: next_prior.hpp Only in ./boost: non_type.hpp Only in ./boost: noncopyable.hpp Only in ./boost: nondet_random.hpp Only in ./boost: none.hpp Only in ./boost: none_t.hpp Only in ./boost: numeric Only in ./boost: operators.hpp Only in ./boost: optional Only in ./boost: optional.hpp Only in ./boost: parameter Only in ./boost: parameter.hpp Only in ./boost: pending Only in ./boost: pointee.hpp Only in ./boost: pointer_cast.hpp Only in ./boost: pointer_to_other.hpp Only in ./boost: polygon Only in ./boost: pool Only in ./boost: preprocessor Only in ./boost: preprocessor.hpp Only in ./boost: program_options Only in ./boost: program_options.hpp Only in ./boost: progress.hpp Only in ./boost: property_map Only in ./boost: property_tree Only in ./boost: proto Only in ./boost: ptr_container Only in ./boost: python Only in ./boost: python.hpp Only in ./boost: random Only in ./boost: random.hpp Only in ./boost: range Only in ./boost: range.hpp Only in ./boost: rational.hpp Only in ./boost: ref.hpp Only in ./boost: regex Only in ./boost: regex.h Only in ./boost: regex.hpp Only in ./boost: regex_fwd.hpp Only in ./boost: scope_exit.hpp Only in ./boost: scoped_array.hpp Only in ./boost: scoped_ptr.hpp Only in ./boost: serialization Only in ./boost: shared_array.hpp Only in ./boost: shared_container_iterator.hpp Only in ./boost: shared_ptr.hpp Only in ./boost: signal.hpp Only in ./boost: signals Only in ./boost: signals.hpp Only in ./boost: signals2 Only in ./boost: signals2.hpp Only in ./boost: smart_ptr Only in ./boost: smart_ptr.hpp Only in ./boost: spirit Only in ./boost: spirit.hpp Only in ./boost: statechart Only in ./boost: static_assert.hpp Only in ./boost: strong_typedef.hpp Only in ./boost: swap.hpp Only in ./boost: system Only in ./boost: test Only in ./boost: thread Only in ./boost: thread.hpp Only in ./boost: throw_exception.hpp Only in ./boost: timer.hpp Only in ./boost: token_functions.hpp Only in ./boost: token_iterator.hpp Only in ./boost: tokenizer.hpp Only in ./boost: tr1 Only in ./boost: tuple Only in ./boost: type.hpp Only in ./boost: type_traits Only in ./boost: type_traits.hpp Only in ./boost: typeof Only in ./boost: units Only in ./boost: unordered Only in ./boost: unordered_map.hpp Only in ./boost: unordered_set.hpp Only in ./boost: utility Only in ./boost: utility.hpp Only in ./boost: uuid Only in ./boost: variant Only in ./boost: variant.hpp Only in ./boost: version.hpp Only in ./boost: visit_each.hpp Only in ./boost: wave Only in ./boost: wave.hpp Only in ./boost: weak_ptr.hpp Only in ./boost: xpressive Only in .: boost-build.jam Only in ../../Libdev/boost-graph-dfs: boost-graph-dfs.komodoproject Only in .: boost.css Only in .: boost.png Only in .: bootstrap.bat Only in .: bootstrap.sh Only in .: doc Only in .: index.htm Only in .: index.html Only in ./libs: accumulators Only in ./libs: algorithm Only in ./libs: any Only in ./libs: array Only in ./libs: asio Only in ./libs: assign Only in ./libs: bimap Only in ./libs: bind Only in ./libs: circular_buffer Only in ./libs: compatibility Only in ./libs: compose Only in ./libs: concept_check Only in ./libs: config Only in ./libs: conversion Only in ./libs: crc Only in ./libs: date_time Only in ./libs: detail Only in ./libs: disjoint_sets Only in ./libs: dynamic_bitset Only in ./libs: exception Only in ./libs: filesystem Only in ./libs: flyweight Only in ./libs: foreach Only in ./libs: format Only in ./libs: function Only in ./libs: function_types Only in ./libs: functional Only in ./libs: fusion Only in ./libs: gil Only in ./libs/graph: build Only in ./libs/graph/doc: AStarHeuristic.html Only in ./libs/graph/doc: AStarVisitor.html Only in ./libs/graph/doc: AddEdgeVisitor.html Only in ./libs/graph/doc: AdjacencyGraph.html Only in ./libs/graph/doc: AdjacencyMatrix.html Only in ./libs/graph/doc: BFSVisitor.html Only in ./libs/graph/doc: BUILD_DOCS.sh Only in ./libs/graph/doc: BasicMatrix.html Only in ./libs/graph/doc: BellmanFordVisitor.html Only in ./libs/graph/doc: BidirectionalGraph.html Only in ./libs/graph/doc: Buffer.html Only in ./libs/graph/doc: ColorValue.html diff --recursive --unified ./libs/graph/doc/DFSVisitor.html ../../Libdev/boost-graph-dfs/libs/graph/doc/DFSVisitor.html --- ./libs/graph/doc/DFSVisitor.html 2010-04-02 11:25:11.000000000 -0400 +++ ../../Libdev/boost-graph-dfs/libs/graph/doc/DFSVisitor.html 2011-03-05 15:23:35.000000000 -0500 @@ -150,6 +150,15 @@ +Finish Edge +vis.finish_edge(e, g) +void + +This is invoked on each non-tree edge as well as on each tree edge after +finish_vertex has been called on its target vertex. + + + Finish Vertex vis.finish_vertex(u, g) void Only in ./libs/graph/doc: DijkstraVisitor.html Only in ./libs/graph/doc: EdgeListGraph.html Only in ./libs/graph/doc: EdgeMutableGraph.html Only in ./libs/graph/doc: EventVisitor.html Only in ./libs/graph/doc: EventVisitorList.html Only in ./libs/graph/doc: Graph.html Only in ./libs/graph/doc: IncidenceGraph.html Only in ./libs/graph/doc: IteratorConstructibleGraph.html Only in ./libs/graph/doc: KeyedUpdatableQueue.html Only in ./libs/graph/doc: Makefile Only in ./libs/graph/doc: Monoid.html Only in ./libs/graph/doc: MutableGraph.html Only in ./libs/graph/doc: MutablePropertyGraph.html Only in ./libs/graph/doc: PlanarEmbedding.html Only in ./libs/graph/doc: PlanarFaceVisitor.html Only in ./libs/graph/doc: PropertyGraph.html Only in ./libs/graph/doc: PropertyTag.html Only in ./libs/graph/doc: TSPTourVisitor.html Only in ./libs/graph/doc: UpdatableQueue.html Only in ./libs/graph/doc: VertexAndEdgeListGraph.html Only in ./libs/graph/doc: VertexListGraph.html Only in ./libs/graph/doc: VertexMutableGraph.html Only in ./libs/graph/doc: acknowledgements.html Only in ./libs/graph/doc: adjacency_iterator.html Only in ./libs/graph/doc: adjacency_list.html Only in ./libs/graph/doc: adjacency_list_traits.html Only in ./libs/graph/doc: adjacency_matrix.html Only in ./libs/graph/doc: astar_heuristic.html Only in ./libs/graph/doc: astar_search.html Only in ./libs/graph/doc: astar_visitor.html Only in ./libs/graph/doc: awpaper.sty Only in ./libs/graph/doc: bandwidth.html Only in ./libs/graph/doc: bc_clustering.html Only in ./libs/graph/doc: bellman_ford_shortest.html Only in ./libs/graph/doc: bellman_visitor.html Only in ./libs/graph/doc: betweenness_centrality.html Only in ./libs/graph/doc: bfs_visitor.html Only in ./libs/graph/doc: bgl-cover.jpg Only in ./libs/graph/doc: bgl_named_params.html Only in ./libs/graph/doc: bibliography.html Only in ./libs/graph/doc: biconnected_components.html Only in ./libs/graph/doc: biconnected_components.w Only in ./libs/graph/doc: boyer_myrvold.html Only in ./libs/graph/doc: boykov_kolmogorov_max_flow.html Only in ./libs/graph/doc: breadth_first_search.html Only in ./libs/graph/doc: breadth_first_visit.html Only in ./libs/graph/doc: bundles.html Only in ./libs/graph/doc: challenge.html Only in ./libs/graph/doc: circle_layout.html Only in ./libs/graph/doc: cochet-terrasson98numerical.pdf Only in ./libs/graph/doc: compressed_sparse_row.html Only in ./libs/graph/doc: connected_components.html Only in ./libs/graph/doc: constructing_algorithms.html Only in ./libs/graph/doc: copy_graph.html Only in ./libs/graph/doc: cuthill_mckee_ordering.html Only in ./libs/graph/doc: dag_shortest_paths.html Only in ./libs/graph/doc: dasdan-dac99.pdf diff --recursive --unified ./libs/graph/doc/depth_first_search.html ../../Libdev/boost-graph-dfs/libs/graph/doc/depth_first_search.html --- ./libs/graph/doc/depth_first_search.html 2010-07-05 12:40:23.000000000 -0400 +++ ../../Libdev/boost-graph-dfs/libs/graph/doc/depth_first_search.html 2011-03-05 15:14:49.000000000 -0500 @@ -107,6 +107,7 @@ ... else if (color[v] = BLACK) ... + ... end for color[u] := BLACK f_time[u] := time := time + 1 @@ -139,6 +140,7 @@ (u,v) is a back edge - (u,v) is a cross or forward edge +finish edge (u,v) - finish vertex u - @@ -249,7 +251,7 @@

vis.start_vertex(s, g) is invoked on the source vertex once before the start of the search. - +

vis.discover_vertex(u, g) is invoked when a vertex is encountered for the first time. @@ -259,14 +261,17 @@

vis.tree_edge(e, g) is invoked on each edge as it becomes a member of the edges that form the search tree. If you wish to record predecessors, do so at this event point. - +

vis.back_edge(e, g) is invoked on the back edges in the graph. - +

vis.forward_or_cross_edge(e, g) is invoked on forward or cross edges in the graph. In an undirected graph this method is never called. - + +

vis.finish_edge(e, g) is invoked on the non-tree edges in + the graph as well as on each tree edge after its target vertex is finished. +

call DFS-VISIT(G, v) else if (vcolor[v] = GRAY and ec = WHITE) ... + ... end for vcolor[u] := BLACK f_time[u] := time := time + 1 @@ -151,6 +152,7 @@ - (u,v) is a back edge - +finish edge (u,v) - finish vertex u - @@ -277,20 +279,23 @@

vis.start_vertex(s, g) is invoked on the source vertex once before the start of the search. - +

vis.discover_vertex(u, g) is invoked when a vertex is encountered for the first time. - +

vis.examine_edge(e, g) is invoked on every out-edge of each vertex after it is discovered.

vis.tree_edge(e, g) is invoked on each edge as it becomes a member of the edges that form the search tree. If you wish to record predecessors, do so at this event point. - +

vis.back_edge(e, g) is invoked on the back edges in the graph. +

vis.finish_edge(e, g) is invoked on the back edges in + the graph as well as on each tree edge after its target vertex is finished. +

vis.finish_vertex(u, g) is invoked on a vertex after all of its out edges have been added to the search tree and all of the adjacent vertices have been discovered (but before their Only in ./libs/graph/doc: users.html Only in ./libs/graph/doc: using_adjacency_list.html Only in ./libs/graph/doc: using_property_maps.html Only in ./libs/graph/doc: visitor_concepts.html Only in ./libs/graph/doc: wavefront.htm Only in ./libs/graph/doc: write-graphviz.html Only in ./libs/graph/doc: write_dimacs.html Only in ./libs/graph/doc: write_graphml.html Only in ./libs/graph/doc: write_graphml.rst Only in ./libs/graph/example: Jamfile.v2 Only in ./libs/graph/example: accum-compile-times.cpp Only in ./libs/graph/example: actor_clustering.cpp Only in ./libs/graph/example: adj_list_ra_edgelist.cpp Only in ./libs/graph/example: adjacency_list.cpp Only in ./libs/graph/example: adjacency_list.expected Only in ./libs/graph/example: adjacency_list_io.cpp Only in ./libs/graph/example: adjacency_matrix.cpp Only in ./libs/graph/example: astar-cities.cpp Only in ./libs/graph/example: astar_maze.cpp Only in ./libs/graph/example: bcsstk01 Only in ./libs/graph/example: bcsstk01.rsa Only in ./libs/graph/example: bellman-example.cpp Only in ./libs/graph/example: bellman-ford-internet.cpp Only in ./libs/graph/example: bellman_ford.expected Only in ./libs/graph/example: bfs-example.cpp Only in ./libs/graph/example: bfs-example2.cpp Only in ./libs/graph/example: bfs-name-printer.cpp Only in ./libs/graph/example: bfs.cpp Only in ./libs/graph/example: bfs.expected Only in ./libs/graph/example: bfs_basics.expected Only in ./libs/graph/example: bfs_neighbor.cpp Only in ./libs/graph/example: biconnected_components.cpp Only in ./libs/graph/example: bipartite_example.cpp Only in ./libs/graph/example: boost_web.dat Only in ./libs/graph/example: boost_web_graph.cpp Only in ./libs/graph/example: boost_web_graph.expected Only in ./libs/graph/example: boykov_kolmogorov-eg.cpp Only in ./libs/graph/example: bron_kerbosch_clique_number.cpp Only in ./libs/graph/example: bron_kerbosch_print_cliques.cpp Only in ./libs/graph/example: bucket_sorter.cpp Only in ./libs/graph/example: canonical_ordering.cpp Only in ./libs/graph/example: cc-internet.cpp Only in ./libs/graph/example: city_visitor.cpp Only in ./libs/graph/example: closeness_centrality.cpp Only in ./libs/graph/example: clustering_coefficient.cpp Only in ./libs/graph/example: comm_network.graph Only in ./libs/graph/example: components_on_edgelist.cpp Only in ./libs/graph/example: components_on_edgelist.expected Only in ./libs/graph/example: concept_checks.expected Only in ./libs/graph/example: connected-components.cpp Only in ./libs/graph/example: connected_components.cpp Only in ./libs/graph/example: connected_components.expected Only in ./libs/graph/example: container_gen.cpp Only in ./libs/graph/example: container_gen.expected Only in ./libs/graph/example: copy-example.cpp Only in ./libs/graph/example: csr-example.cpp Only in ./libs/graph/example: cuthill_mckee_ordering.cpp Only in ./libs/graph/example: cuthill_mckee_ordering.expected Only in ./libs/graph/example: cycle-file-dep.cpp Only in ./libs/graph/example: cycle-file-dep2.cpp Only in ./libs/graph/example: cycle_ratio_example.cpp Only in ./libs/graph/example: dag_shortest_paths.cpp Only in ./libs/graph/example: data1.txt Only in ./libs/graph/example: data2.txt Only in ./libs/graph/example: data3.txt Only in ./libs/graph/example: dave.cpp Only in ./libs/graph/example: dave.expected Only in ./libs/graph/example: default-constructor.cpp Only in ./libs/graph/example: default-constructor2.cpp Only in ./libs/graph/example: degree_centrality.cpp Only in ./libs/graph/example: dfs-example.cpp Only in ./libs/graph/example: dfs-parenthesis.cpp diff --recursive --unified ./libs/graph/example/dfs.cpp ../../Libdev/boost-graph-dfs/libs/graph/example/dfs.cpp --- ./libs/graph/example/dfs.cpp 2005-03-24 09:54:12.000000000 -0500 +++ ../../Libdev/boost-graph-dfs/libs/graph/example/dfs.cpp 2011-03-06 12:34:32.000000000 -0500 @@ -27,12 +27,21 @@ Tree edge: 0 --> 2 Tree edge: 2 --> 1 Back edge: 1 --> 1 + Finish edge: 1 --> 1 Tree edge: 1 --> 3 Back edge: 3 --> 1 + Finish edge: 3 --> 1 Tree edge: 3 --> 4 Back edge: 4 --> 0 + Finish edge: 4 --> 0 Back edge: 4 --> 1 + Finish edge: 4 --> 1 + Finish edge: 3 --> 4 + Finish edge: 1 --> 3 + Finish edge: 2 --> 1 Forward or cross edge: 2 --> 3 + Finish edge: 2 --> 3 + Finish edge: 0 --> 2 1 10 3 8 2 9 @@ -69,6 +78,12 @@ << " --> " << target(e, G) << endl; Base::forward_or_cross_edge(e, G); } + template + void finish_edge(Edge e, Graph& G) { + cout << "Finish edge: " << source(e, G) << + " --> " << target(e, G) << endl; + Base::finish_edge(e, G); + } }; template edge_categorizer diff --recursive --unified ./libs/graph/example/dfs.expected ../../Libdev/boost-graph-dfs/libs/graph/example/dfs.expected --- ./libs/graph/example/dfs.expected 2008-11-03 17:29:39.000000000 -0500 +++ ../../Libdev/boost-graph-dfs/libs/graph/example/dfs.expected 2011-03-05 14:36:24.000000000 -0500 @@ -1,12 +1,21 @@ Tree edge: 0 --> 2 Tree edge: 2 --> 1 Back edge: 1 --> 1 +Finish edge: 1 --> 1 Tree edge: 1 --> 3 Back edge: 3 --> 1 +Finish edge: 3 --> 1 Tree edge: 3 --> 4 Back edge: 4 --> 0 +Finish edge: 4 --> 0 Back edge: 4 --> 1 +Finish edge: 4 --> 1 +Finish edge: 3 --> 4 +Finish edge: 1 --> 3 +Finish edge: 2 --> 1 Forward or cross edge: 2 --> 3 +Finish edge: 2 --> 3 +Finish edge: 0 --> 2 1 10 3 8 2 9 Only in ./libs/graph/example: dfs_basics.expected Only in ./libs/graph/example: dfs_parenthesis.cpp Only in ./libs/graph/example: dfs_parenthesis.expected Only in ./libs/graph/example: dijkstra-example-listS.cpp Only in ./libs/graph/example: dijkstra-example.cpp Only in ./libs/graph/example: dijkstra-no-color-map-example.cpp Only in ./libs/graph/example: dijkstra.expected Only in ./libs/graph/example: eccentricity.cpp Only in ./libs/graph/example: edge-connectivity.cpp Only in ./libs/graph/example: edge-function.cpp Only in ./libs/graph/example: edge-iter-constructor.cpp Only in ./libs/graph/example: edge_basics.cpp Only in ./libs/graph/example: edge_basics.expected Only in ./libs/graph/example: edge_connectivity.cpp Only in ./libs/graph/example: edge_iterator_constructor.cpp Only in ./libs/graph/example: edge_iterator_constructor.dat Only in ./libs/graph/example: edge_property.cpp Only in ./libs/graph/example: edge_property.expected Only in ./libs/graph/example: edmonds-karp-eg.cpp Only in ./libs/graph/example: exterior_properties.cpp Only in ./libs/graph/example: exterior_properties.expected Only in ./libs/graph/example: exterior_property_map.cpp Only in ./libs/graph/example: exterior_property_map.expected Only in ./libs/graph/example: family-tree-eg.cpp Only in ./libs/graph/example: family_tree.expected Only in ./libs/graph/example: fibonacci_heap.cpp Only in ./libs/graph/example: fibonacci_heap.expected Only in ./libs/graph/example: figs Only in ./libs/graph/example: file_dependencies.cpp Only in ./libs/graph/example: file_dependencies.expected Only in ./libs/graph/example: filtered-copy-example.cpp Only in ./libs/graph/example: filtered_graph.cpp Only in ./libs/graph/example: filtered_graph.expected Only in ./libs/graph/example: filtered_graph_edge_range.cpp Only in ./libs/graph/example: filtered_vec_as_graph.cpp Only in ./libs/graph/example: fr_layout.cpp Only in ./libs/graph/example: gerdemann.cpp Only in ./libs/graph/example: gerdemann.expected Only in ./libs/graph/example: girth.cpp Only in ./libs/graph/example: graph-assoc-types.cpp Only in ./libs/graph/example: graph-property-iter-eg.cpp Only in ./libs/graph/example: graph-thingie.cpp Only in ./libs/graph/example: graph.cpp Only in ./libs/graph/example: graph_as_tree.cpp Only in ./libs/graph/example: graph_property.cpp Only in ./libs/graph/example: graphviz.cpp Only in ./libs/graph/example: graphviz_example.dot Only in ./libs/graph/example: graphviz_test.dot Only in ./libs/graph/example: grid_graph_example.cpp Only in ./libs/graph/example: helper.hpp Only in ./libs/graph/example: implicit_graph.cpp Only in ./libs/graph/example: in_edges.cpp Only in ./libs/graph/example: in_edges.expected Only in ./libs/graph/example: inclusive_mean_geodesic.cpp Only in ./libs/graph/example: incremental-components-eg.cpp Only in ./libs/graph/example: incremental_components.cpp Only in ./libs/graph/example: incremental_components.expected Only in ./libs/graph/example: influence_prestige.cpp Only in ./libs/graph/example: info_network.graph Only in ./libs/graph/example: interior_pmap_bundled.cpp Only in ./libs/graph/example: interior_property_map.cpp Only in ./libs/graph/example: interior_property_map.expected Only in ./libs/graph/example: iohb.c Only in ./libs/graph/example: iohb.h Only in ./libs/graph/example: isomorphism.cpp Only in ./libs/graph/example: iteration_macros.cpp Only in ./libs/graph/example: iterator-property-map-eg.cpp Only in ./libs/graph/example: johnson-eg.cpp Only in ./libs/graph/example: johnson.expected Only in ./libs/graph/example: kevin-bacon.cpp Only in ./libs/graph/example: kevin-bacon.dat Only in ./libs/graph/example: kevin-bacon2.cpp Only in ./libs/graph/example: kevin-bacon2.dat Only in ./libs/graph/example: kevin-bacon2.expected Only in ./libs/graph/example: kevin_bacon.expected Only in ./libs/graph/example: king_ordering.cpp Only in ./libs/graph/example: knights-tour.cpp Only in ./libs/graph/example: knights_tour.expected Only in ./libs/graph/example: kruskal-example.cpp Only in ./libs/graph/example: kruskal-telephone.cpp Only in ./libs/graph/example: kruskal.expected Only in ./libs/graph/example: kuratowski_subgraph.cpp Only in ./libs/graph/example: labeled_graph.cpp Only in ./libs/graph/example: last-mod-time.cpp Only in ./libs/graph/example: leda-concept-check.cpp Only in ./libs/graph/example: leda-graph-eg.cpp Only in ./libs/graph/example: leda-regression.cfg Only in ./libs/graph/example: loops_dfs.cpp Only in ./libs/graph/example: make_biconnected_planar.cpp Only in ./libs/graph/example: make_connected.cpp Only in ./libs/graph/example: make_maximal_planar.cpp Only in ./libs/graph/example: makefile-dependencies.dat Only in ./libs/graph/example: makefile-target-names.dat Only in ./libs/graph/example: matching_example.cpp Only in ./libs/graph/example: max_flow.cpp Only in ./libs/graph/example: max_flow.dat Only in ./libs/graph/example: max_flow.expected Only in ./libs/graph/example: max_flow2.dat Only in ./libs/graph/example: max_flow3.dat Only in ./libs/graph/example: max_flow4.dat Only in ./libs/graph/example: max_flow5.dat Only in ./libs/graph/example: max_flow6.dat Only in ./libs/graph/example: max_flow7.dat Only in ./libs/graph/example: max_flow8.dat Only in ./libs/graph/example: max_flow9.dat Only in ./libs/graph/example: mcgregor_subgraphs_example.cpp Only in ./libs/graph/example: mean_geodesic.cpp Only in ./libs/graph/example: miles_span.cpp Only in ./libs/graph/example: miles_span.expected Only in ./libs/graph/example: min_max_paths.cpp Only in ./libs/graph/example: minimum_degree_ordering.cpp Only in ./libs/graph/example: modify_graph.cpp Only in ./libs/graph/example: modify_graph.expected Only in ./libs/graph/example: neighbor_bfs.cpp Only in ./libs/graph/example: ordered_out_edges.cpp Only in ./libs/graph/example: ordered_out_edges.expected Only in ./libs/graph/example: ospf-example.cpp Only in ./libs/graph/example: parallel-compile-time.cpp Only in ./libs/graph/example: planar_face_traversal.cpp Only in ./libs/graph/example: prim-example.cpp Only in ./libs/graph/example: prim-telephone.cpp Only in ./libs/graph/example: prim.expected Only in ./libs/graph/example: print-adjacent-vertices.cpp Only in ./libs/graph/example: print-edges.cpp Only in ./libs/graph/example: print-in-edges.cpp Only in ./libs/graph/example: print-out-edges.cpp Only in ./libs/graph/example: prism_3_2.graph Only in ./libs/graph/example: prob_network.graph Only in ./libs/graph/example: property-map-traits-eg.cpp Only in ./libs/graph/example: property_iterator.cpp Only in ./libs/graph/example: push-relabel-eg.cpp Only in ./libs/graph/example: put-get-helper-eg.cpp Only in ./libs/graph/example: quick-tour.cpp Only in ./libs/graph/example: quick_tour.cpp Only in ./libs/graph/example: quick_tour.expected Only in ./libs/graph/example: r_c_shortest_paths_example.cpp Only in ./libs/graph/example: reachable-loop-head.cpp Only in ./libs/graph/example: reachable-loop-tail.cpp Only in ./libs/graph/example: read_graphviz.cpp Only in ./libs/graph/example: read_write_dimacs-eg.cpp Only in ./libs/graph/example: regression.cfg Only in ./libs/graph/example: remove_edge_if_bidir.cpp Only in ./libs/graph/example: remove_edge_if_bidir.expected Only in ./libs/graph/example: remove_edge_if_dir.cpp Only in ./libs/graph/example: remove_edge_if_dir.expected Only in ./libs/graph/example: remove_edge_if_undir.cpp Only in ./libs/graph/example: remove_edge_if_undir.expected Only in ./libs/graph/example: reverse-graph-eg.cpp Only in ./libs/graph/example: reverse_graph.expected Only in ./libs/graph/example: roget_components.cpp Only in ./libs/graph/example: scaled_closeness_centrality.cpp Only in ./libs/graph/example: scc.cpp Only in ./libs/graph/example: scc.dot Only in ./libs/graph/example: sgb-regression.cfg Only in ./libs/graph/example: simple_planarity_test.cpp Only in ./libs/graph/example: sloan_ordering.cpp Only in ./libs/graph/example: social_network.graph Only in ./libs/graph/example: stoer_wagner.cpp Only in ./libs/graph/example: straight_line_drawing.cpp Only in ./libs/graph/example: strong-components.cpp Only in ./libs/graph/example: strong_components.cpp Only in ./libs/graph/example: strong_components.expected Only in ./libs/graph/example: subgraph.cpp Only in ./libs/graph/example: subgraph.expected Only in ./libs/graph/example: subgraph_properties.cpp Only in ./libs/graph/example: target-compile-costs.dat Only in ./libs/graph/example: tc.dot Only in ./libs/graph/example: test-astar-cities.dot Only in ./libs/graph/example: tiernan_girth_circumference.cpp Only in ./libs/graph/example: tiernan_print_cycles.cpp Only in ./libs/graph/example: topo-sort-file-dep.cpp Only in ./libs/graph/example: topo-sort-file-dep2.cpp Only in ./libs/graph/example: topo-sort-with-leda.cpp Only in ./libs/graph/example: topo-sort-with-sgb.cpp Only in ./libs/graph/example: topo-sort1.cpp Only in ./libs/graph/example: topo-sort2.cpp Only in ./libs/graph/example: topo_sort.cpp Only in ./libs/graph/example: topo_sort.expected Only in ./libs/graph/example: transitive_closure.cpp Only in ./libs/graph/example: transpose-example.cpp Only in ./libs/graph/example: undirected.cpp Only in ./libs/graph/example: undirected.expected Only in ./libs/graph/example: undirected_dfs.cpp Only in ./libs/graph/example: vector-as-graph.cpp Only in ./libs/graph/example: vector_as_graph.expected Only in ./libs/graph/example: vertex-name-property.cpp Only in ./libs/graph/example: vertex_basics.cpp Only in ./libs/graph/example: vertex_basics.expected Only in ./libs/graph/example: visitor.cpp Only in ./libs/graph/example: visitor.expected Only in ./libs/graph/example: write_graphviz.cpp Only in ./libs/graph: index.html Only in ./libs/graph: src diff --recursive --unified ./libs/graph/test/Jamfile.v2 ../../Libdev/boost-graph-dfs/libs/graph/test/Jamfile.v2 --- ./libs/graph/test/Jamfile.v2 2011-01-11 13:52:51.000000000 -0500 +++ ../../Libdev/boost-graph-dfs/libs/graph/test/Jamfile.v2 2011-03-05 15:50:48.000000000 -0500 @@ -42,6 +42,7 @@ [ run csr_graph_test.cpp : : : : : release ] [ run dag_longest_paths.cpp ] [ run dfs.cpp ../../test/build//boost_test_exec_monitor ] + [ run undirected_dfs.cpp ../../test/build//boost_test_exec_monitor ] [ compile dfs_cc.cpp ] [ compile dijkstra_cc.cpp ] [ run dijkstra_heap_performance.cpp : 10000 ] Only in ./libs/graph/test: adj_list_cc.cpp Only in ./libs/graph/test: adj_list_edge_list_set.cpp Only in ./libs/graph/test: adj_list_invalidation.cpp Only in ./libs/graph/test: adj_list_loops.cpp Only in ./libs/graph/test: adj_list_test.cpp Only in ./libs/graph/test: adj_matrix_cc.cpp Only in ./libs/graph/test: adjacency_matrix_test.cpp Only in ./libs/graph/test: all_planar_input_files_test.cpp Only in ./libs/graph/test: astar_search_test.cpp Only in ./libs/graph/test: basic_planarity_test.cpp Only in ./libs/graph/test: bellman-test.cpp Only in ./libs/graph/test: betweenness_centrality_test.cpp Only in ./libs/graph/test: bfs.cpp Only in ./libs/graph/test: bfs_cc.cpp Only in ./libs/graph/test: biconnected_components_test.cpp Only in ./libs/graph/test: bidir_remove_edge.cpp Only in ./libs/graph/test: bidir_vec_remove_edge.cpp Only in ./libs/graph/test: bipartite_test.cpp Only in ./libs/graph/test: boykov_kolmogorov_max_flow_test.cpp Only in ./libs/graph/test: bron_kerbosch_all_cliques.cpp Only in ./libs/graph/test: bundled_properties.cpp Only in ./libs/graph/test: closeness_centrality.cpp Only in ./libs/graph/test: clustering_coefficient.cpp Only in ./libs/graph/test: copy.cpp Only in ./libs/graph/test: core_numbers_test.cpp Only in ./libs/graph/test: csr_graph_test.cpp Only in ./libs/graph/test: cuthill_mckee_ordering.cpp Only in ./libs/graph/test: cycle_ratio_s382.90.dot Only in ./libs/graph/test: cycle_ratio_tests.cpp Only in ./libs/graph/test: dag_longest_paths.cpp Only in ./libs/graph/test: degree_centrality.cpp diff --recursive --unified ./libs/graph/test/dfs.cpp ../../Libdev/boost-graph-dfs/libs/graph/test/dfs.cpp --- ./libs/graph/test/dfs.cpp 2009-12-28 22:50:53.000000000 -0500 +++ ../../Libdev/boost-graph-dfs/libs/graph/test/dfs.cpp 2011-03-05 14:11:00.000000000 -0500 @@ -68,6 +68,14 @@ using namespace boost; BOOST_CHECK( get(m_color, target(e, g)) == Color::black() ); } + template + void finish_edge(Edge e, Graph& g) { + using namespace boost; + BOOST_CHECK( + (get(m_color, target(e, g)) == Color::gray()) + || (get(m_color, target(e, g)) == Color::black()) + ); + } template void finish_vertex(Vertex u, Graph&) { using namespace boost; Only in ./libs/graph/test: dfs_cc.cpp Only in ./libs/graph/test: dijkstra_cc.cpp Only in ./libs/graph/test: dijkstra_heap_performance.cpp Only in ./libs/graph/test: dijkstra_no_color_map_compare.cpp Only in ./libs/graph/test: dimacs.cpp Only in ./libs/graph/test: dominator_tree_test.cpp Only in ./libs/graph/test: eccentricity.cpp Only in ./libs/graph/test: edge_list_cc.cpp Only in ./libs/graph/test: filter_graph_vp_test.cpp Only in ./libs/graph/test: filtered_graph_cc.cpp Only in ./libs/graph/test: floyd_warshall_test.cpp Only in ./libs/graph/test: generator_test.cpp Only in ./libs/graph/test: graph.cpp Only in ./libs/graph/test: graph_concepts.cpp Only in ./libs/graph/test: graph_type.hpp Only in ./libs/graph/test: graphml_test.cpp Only in ./libs/graph/test: graphml_test.xml Only in ./libs/graph/test: graphviz_test.cpp Only in ./libs/graph/test: grid_graph_cc.cpp Only in ./libs/graph/test: grid_graph_test.cpp Only in ./libs/graph/test: gursoy_atun_layout_test.cpp Only in ./libs/graph/test: incremental_components_test.cpp Only in ./libs/graph/test: index_graph.cpp Only in ./libs/graph/test: is_straight_line_draw_test.cpp Only in ./libs/graph/test: isomorphism.cpp Only in ./libs/graph/test: johnson-test.cpp Only in ./libs/graph/test: king_ordering.cpp Only in ./libs/graph/test: labeled_graph.cpp Only in ./libs/graph/test: layout_test.cpp Only in ./libs/graph/test: leda_graph_cc.cpp Only in ./libs/graph/test: lvalue_pmap.cpp Only in ./libs/graph/test: make_bicon_planar_test.cpp Only in ./libs/graph/test: make_connected_test.cpp Only in ./libs/graph/test: make_maximal_planar_test.cpp Only in ./libs/graph/test: matching_test.cpp Only in ./libs/graph/test: max_flow_test.cpp Only in ./libs/graph/test: mcgregor_subgraphs_test.cpp Only in ./libs/graph/test: mean_geodesic.cpp Only in ./libs/graph/test: metis_test.cpp Only in ./libs/graph/test: metric_tsp_approx.cpp Only in ./libs/graph/test: metric_tsp_approx.graph Only in ./libs/graph/test: named_vertices_test.cpp Only in ./libs/graph/test: parallel_edges_loops_test.cpp Only in ./libs/graph/test: planar_input_graphs Only in ./libs/graph/test: prgen_input_graphs Only in ./libs/graph/test: property_iter.cpp Only in ./libs/graph/test: r_c_shortest_paths_test.cpp Only in ./libs/graph/test: random_matching_test.cpp Only in ./libs/graph/test: random_spanning_tree_test.cpp Only in ./libs/graph/test: read_propmap.cpp Only in ./libs/graph/test: regression.cfg Only in ./libs/graph/test: relaxed_heap_test.cpp Only in ./libs/graph/test: reverse_graph_cc.cpp Only in ./libs/graph/test: sequential_vertex_coloring.cpp Only in ./libs/graph/test: serialize.cpp Only in ./libs/graph/test: stanford_graph_cc.cpp Only in ./libs/graph/test: stoer_wagner_test.cpp Only in ./libs/graph/test: subgraph.cpp Only in ./libs/graph/test: subgraph_bundled.cpp Only in ./libs/graph/test: subgraph_props.cpp Only in ./libs/graph/test: test_construction.hpp Only in ./libs/graph/test: test_destruction.hpp Only in ./libs/graph/test: test_direction.hpp Only in ./libs/graph/test: test_graph.hpp Only in ./libs/graph/test: test_graphs.cpp Only in ./libs/graph/test: test_iteration.hpp Only in ./libs/graph/test: test_properties.hpp Only in ./libs/graph/test: tiernan_all_cycles.cpp Only in ./libs/graph/test: transitive_closure_test.cpp Only in ./libs/graph/test: transitive_closure_test2.cpp Only in ./libs/graph/test: typestr.hpp Only in ../../Libdev/boost-graph-dfs/libs/graph/test: undirected_dfs.cpp Only in ./libs/graph/test: vector_graph_cc.cpp Only in ./libs/graph/test: weighted_graph.gr Only in ./libs: graph_parallel Only in ./libs: icl Only in ./libs: index.html Only in ./libs: integer Only in ./libs: interprocess Only in ./libs: intrusive Only in ./libs: io Only in ./libs: iostreams Only in ./libs: iterator Only in ./libs: lambda Only in ./libs: libraries.htm Only in ./libs: logic Only in ./libs: maintainers.txt Only in ./libs: math Only in ./libs: mem_fn Only in ./libs: mpi Only in ./libs: mpl Only in ./libs: msm Only in ./libs: multi_array Only in ./libs: multi_index Only in ./libs: numeric Only in ./libs: optional Only in ./libs: parameter Only in ./libs: platform_maintainers.txt Only in ./libs: polygon Only in ./libs: pool Only in ./libs: preprocessor Only in ./libs: program_options Only in ./libs: property_map Only in ./libs: property_tree Only in ./libs: proto Only in ./libs: ptr_container Only in ./libs: python Only in ./libs: random Only in ./libs: range Only in ./libs: rational Only in ./libs: regex Only in ./libs: scope_exit Only in ./libs: serialization Only in ./libs: signals Only in ./libs: signals2 Only in ./libs: smart_ptr Only in ./libs: spirit Only in ./libs: statechart Only in ./libs: static_assert Only in ./libs: system Only in ./libs: test Only in ./libs: thread Only in ./libs: timer Only in ./libs: tokenizer Only in ./libs: tr1 Only in ./libs: tuple Only in ./libs: type_traits Only in ./libs: typeof Only in ./libs: units Only in ./libs: unordered Only in ./libs: utility Only in ./libs: uuid Only in ./libs: variant Only in ./libs: wave Only in ./libs: xpressive Only in .: more Only in .: rst.css Only in .: status Only in .: tools