FM / graph

/usr/include/boost/graph

Name	Size	Mode	Actions
detail/	-	0755	rm
distributed/	-	0755	rm
parallel/	-	0755	rm
planar_detail/	-	0755	rm
property_maps/	-	0755	rm
accounting.hpp	876	0644	edit dl rm
adjacency_iterator.hpp	2899	0644	edit dl rm
adjacency_list.hpp	13692	0644	edit dl rm
adjacency_list_io.hpp	11849	0644	edit dl rm
adjacency_matrix.hpp	45743	0644	edit dl rm
adj_list_serialize.hpp	4523	0644	edit dl rm
astar_search.hpp	26736	0644	edit dl rm
bandwidth.hpp	2992	0644	edit dl rm
bc_clustering.hpp	5937	0644	edit dl rm
bellman_ford_shortest_paths.hpp	8229	0644	edit dl rm
betweenness_centrality.hpp	26290	0644	edit dl rm
biconnected_components.hpp	16701	0644	edit dl rm
bipartite.hpp	13492	0644	edit dl rm
boyer_myrvold_planar_test.hpp	9849	0644	edit dl rm
boykov_kolmogorov_max_flow.hpp	47342	0644	edit dl rm
breadth_first_search.hpp	14751	0644	edit dl rm
bron_kerbosch_all_cliques.hpp	11736	0644	edit dl rm
buffer_concepts.hpp	2429	0644	edit dl rm
chrobak_payne_drawing.hpp	8641	0644	edit dl rm
circle_layout.hpp	1924	0644	edit dl rm
closeness_centrality.hpp	6057	0644	edit dl rm
clustering_coefficient.hpp	5726	0644	edit dl rm
compressed_sparse_row_graph.hpp	69887	0644	edit dl rm
connected_components.hpp	4134	0644	edit dl rm
copy.hpp	21225	0644	edit dl rm
core_numbers.hpp	13663	0644	edit dl rm
create_condensation_graph.hpp	3159	0644	edit dl rm
cuthill_mckee_ordering.hpp	5992	0644	edit dl rm
cycle_canceling.hpp	6645	0644	edit dl rm
dag_shortest_paths.hpp	6064	0644	edit dl rm
degree_centrality.hpp	4236	0644	edit dl rm
depth_first_search.hpp	15430	0644	edit dl rm
dijkstra_shortest_paths.hpp	23687	0644	edit dl rm
dijkstra_shortest_paths_no_color_map.hpp	9620	0644	edit dl rm
dimacs.hpp	10448	0644	edit dl rm
directed_graph.hpp	24214	0644	edit dl rm
dll_import_export.hpp	892	0644	edit dl rm
dominator_tree.hpp	17553	0644	edit dl rm
eccentricity.hpp	4611	0644	edit dl rm
edge_coloring.hpp	6809	0644	edit dl rm
edge_connectivity.hpp	6796	0644	edit dl rm
edge_list.hpp	9948	0644	edit dl rm
edmonds_karp_max_flow.hpp	10177	0644	edit dl rm
edmunds_karp_max_flow.hpp	982	0644	edit dl rm
erdos_renyi_generator.hpp	7257	0644	edit dl rm
exception.hpp	1466	0644	edit dl rm
exterior_property.hpp	4289	0644	edit dl rm
filtered_graph.hpp	20098	0644	edit dl rm
find_flow_cost.hpp	1859	0644	edit dl rm
floyd_warshall_shortest.hpp	8510	0644	edit dl rm
fruchterman_reingold.hpp	17325	0644	edit dl rm
geodesic_distance.hpp	8015	0644	edit dl rm
graphml.hpp	13460	0644	edit dl rm
graphviz.hpp	33503	0644	edit dl rm
graph_archetypes.hpp	11008	0644	edit dl rm
graph_as_tree.hpp	4532	0644	edit dl rm
graph_concepts.hpp	19785	0644	edit dl rm
graph_mutability_traits.hpp	4995	0644	edit dl rm
graph_selectors.hpp	1274	0644	edit dl rm
graph_stats.hpp	4394	0644	edit dl rm
graph_traits.hpp	13065	0644	edit dl rm
graph_utility.hpp	16182	0644	edit dl rm
grid_graph.hpp	33830	0644	edit dl rm
gursoy_atun_layout.hpp	13248	0644	edit dl rm
hawick_circuits.hpp	14593	0644	edit dl rm
howard_cycle_ratio.hpp	23107	0644	edit dl rm
incremental_components.hpp	8224	0644	edit dl rm
isomorphism.hpp	26308	0644	edit dl rm
is_kuratowski_subgraph.hpp	10260	0644	edit dl rm
is_straight_line_drawing.hpp	7230	0644	edit dl rm
iteration_macros.hpp	11659	0644	edit dl rm
iteration_macros_undef.hpp	673	0644	edit dl rm
johnson_all_pairs_shortest.hpp	7646	0644	edit dl rm
kamada_kawai_spring_layout.hpp	28048	0644	edit dl rm
king_ordering.hpp	12101	0644	edit dl rm
kruskal_min_spanning_tree.hpp	5743	0644	edit dl rm
labeled_graph.hpp	30914	0644	edit dl rm
leda_graph.hpp	28789	0644	edit dl rm
lookup_edge.hpp	1894	0644	edit dl rm
loop_erased_random_walk.hpp	4436	0644	edit dl rm
make_biconnected_planar.hpp	3513	0644	edit dl rm
make_connected.hpp	2645	0644	edit dl rm
make_maximal_planar.hpp	7578	0644	edit dl rm
matrix_as_graph.hpp	7227	0644	edit dl rm
maximum_adjacency_search.hpp	15125	0644	edit dl rm
maximum_weighted_matching.hpp	49722	0644	edit dl rm
max_cardinality_matching.hpp	31000	0644	edit dl rm
mcgregor_common_subgraphs.hpp	43470	0644	edit dl rm
mesh_graph_generator.hpp	5616	0644	edit dl rm
metis.hpp	10982	0644	edit dl rm
metric_tsp_approx.hpp	10809	0644	edit dl rm
minimum_degree_ordering.hpp	27087	0644	edit dl rm
named_function_params.hpp	39639	0644	edit dl rm
named_graph.hpp	20614	0644	edit dl rm
neighbor_bfs.hpp	11763	0644	edit dl rm
numeric_values.hpp	1814	0644	edit dl rm
one_bit_color_map.hpp	3277	0644	edit dl rm
overloading.hpp	1584	0644	edit dl rm
page_rank.hpp	6164	0644	edit dl rm
planar_canonical_ordering.hpp	7203	0644	edit dl rm
planar_face_traversal.hpp	6020	0644	edit dl rm
plod_generator.hpp	7708	0644	edit dl rm
point_traits.hpp	782	0644	edit dl rm
prim_minimum_spanning_tree.hpp	2960	0644	edit dl rm
profile.hpp	1327	0644	edit dl rm
properties.hpp	12417	0644	edit dl rm
property_iter_range.hpp	4345	0644	edit dl rm
push_relabel_max_flow.hpp	34737	0644	edit dl rm
random.hpp	9672	0644	edit dl rm
random_layout.hpp	988	0644	edit dl rm
random_spanning_tree.hpp	5775	0644	edit dl rm
read_dimacs.hpp	12080	0644	edit dl rm
relax.hpp	4400	0644	edit dl rm
reverse_graph.hpp	22402	0644	edit dl rm
rmat_graph_generator.hpp	19291	0644	edit dl rm
r_c_shortest_paths.hpp	30673	0644	edit dl rm
sequential_vertex_coloring.hpp	4562	0644	edit dl rm
simple_point.hpp	628	0644	edit dl rm
sloan_ordering.hpp	15540	0644	edit dl rm
smallest_last_ordering.hpp	5458	0644	edit dl rm
small_world_generator.hpp	3670	0644	edit dl rm
ssca_graph_generator.hpp	6564	0644	edit dl rm
stanford_graph.hpp	20126	0644	edit dl rm
stoer_wagner_min_cut.hpp	12415	0644	edit dl rm
strong_components.hpp	13009	0644	edit dl rm
st_connected.hpp	2852	0644	edit dl rm
subgraph.hpp	39996	0644	edit dl rm
successive_shortest_path_nonnegative_weights.hpp	10413	0644	edit dl rm
tiernan_all_cycles.hpp	12547	0644	edit dl rm
topological_sort.hpp	2611	0644	edit dl rm
topology.hpp	20389	0644	edit dl rm
transitive_closure.hpp	14260	0644	edit dl rm
transitive_reduction.hpp	5326	0644	edit dl rm
transpose_graph.hpp	1198	0644	edit dl rm
tree_traits.hpp	1338	0644	edit dl rm
two_bit_color_map.hpp	3510	0644	edit dl rm
two_graphs_common_spanning_trees.hpp	34996	0644	edit dl rm
undirected_dfs.hpp	10672	0644	edit dl rm
undirected_graph.hpp	25276	0644	edit dl rm
use_mpi.hpp	437	0644	edit dl rm
vector_as_graph.hpp	10474	0644	edit dl rm
vertex_and_edge_range.hpp	5528	0644	edit dl rm
vf2_sub_graph_iso.hpp	48585	0644	edit dl rm
visitors.hpp	11318	0644	edit dl rm
wavefront.hpp	3932	0644	edit dl rm
write_dimacs.hpp	2889	0644	edit dl rm

Edit: /usr/include/boost/graph/strong_components.hpp (13009B)

//
//=======================================================================
// Copyright 1997, 1998, 1999, 2000 University of Notre Dame.
// Authors: Andrew Lumsdaine, Lie-Quan Lee, Jeremy G. Siek
//
// Distributed under the Boost Software License, Version 1.0. (See
// accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
//=======================================================================
//

#ifndef BOOST_GRAPH_STRONG_COMPONENTS_HPP
#define BOOST_GRAPH_STRONG_COMPONENTS_HPP

#include <stack>
#include <boost/config.hpp>
#include <boost/graph/depth_first_search.hpp>
#include <boost/type_traits/conversion_traits.hpp>
#include <boost/static_assert.hpp>
#include <boost/graph/overloading.hpp>
#include <boost/graph/detail/mpi_include.hpp>
#include <boost/concept/assert.hpp>

namespace boost
{

//==========================================================================
// This is Tarjan's algorithm for strongly connected components
// from his paper "Depth first search and linear graph algorithms".
// It calculates the components in a single application of DFS.
// We implement the algorithm as a dfs-visitor.

namespace detail
{

template < typename ComponentMap, typename RootMap, typename DiscoverTime,
        typename Stack >
    class tarjan_scc_visitor : public dfs_visitor<>
    {
        typedef typename property_traits< ComponentMap >::value_type comp_type;
        typedef typename property_traits< DiscoverTime >::value_type time_type;

public:
        tarjan_scc_visitor(ComponentMap comp_map, RootMap r, DiscoverTime d,
            comp_type& c_, Stack& s_)
        : c(c_)
        , comp(comp_map)
        , root(r)
        , discover_time(d)
        , dfs_time(time_type())
        , s(s_)
        {
        }

template < typename Graph >
        void discover_vertex(
            typename graph_traits< Graph >::vertex_descriptor v, const Graph&)
        {
            put(root, v, v);
            put(comp, v, (std::numeric_limits< comp_type >::max)());
            put(discover_time, v, dfs_time++);
            s.push(v);
        }
        template < typename Graph >
        void finish_vertex(
            typename graph_traits< Graph >::vertex_descriptor v, const Graph& g)
        {
            typename graph_traits< Graph >::vertex_descriptor w;
            typename graph_traits< Graph >::out_edge_iterator ei, ei_end;
            for (boost::tie(ei, ei_end) = out_edges(v, g); ei != ei_end; ++ei)
            {
                w = target(*ei, g);
                if (get(comp, w) == (std::numeric_limits< comp_type >::max)())
                    put(root, v,
                        this->min_discover_time(get(root, v), get(root, w)));
            }
            if (get(root, v) == v)
            {
                do
                {
                    w = s.top();
                    s.pop();
                    put(comp, w, c);
                    put(root, w, v);
                } while (w != v);
                ++c;
            }
        }

private:
        template < typename Vertex >
        Vertex min_discover_time(Vertex u, Vertex v)
        {
            return get(discover_time, u) < get(discover_time, v) ? u : v;
        }

comp_type& c;
        ComponentMap comp;
        RootMap root;
        DiscoverTime discover_time;
        time_type dfs_time;
        Stack& s;
    };

template < class Graph, class ComponentMap, class RootMap,
        class DiscoverTime, class P, class T, class R >
    typename property_traits< ComponentMap >::value_type strong_components_impl(
        const Graph& g, // Input
        ComponentMap comp, // Output
        // Internal record keeping
        RootMap root, DiscoverTime discover_time,
        const bgl_named_params< P, T, R >& params)
    {
        typedef typename graph_traits< Graph >::vertex_descriptor Vertex;
        BOOST_CONCEPT_ASSERT(
            (ReadWritePropertyMapConcept< ComponentMap, Vertex >));
        BOOST_CONCEPT_ASSERT((ReadWritePropertyMapConcept< RootMap, Vertex >));
        typedef typename property_traits< RootMap >::value_type RootV;
        BOOST_CONCEPT_ASSERT((ConvertibleConcept< RootV, Vertex >));
        BOOST_CONCEPT_ASSERT(
            (ReadWritePropertyMapConcept< DiscoverTime, Vertex >));

typename property_traits< ComponentMap >::value_type total = 0;

std::stack< Vertex > s;
        detail::tarjan_scc_visitor< ComponentMap, RootMap, DiscoverTime,
            std::stack< Vertex > >
            vis(comp, root, discover_time, total, s);
        depth_first_search(g, params.visitor(vis));
        return total;
    }

//-------------------------------------------------------------------------
    // The dispatch functions handle the defaults for the rank and discover
    // time property maps.
    // dispatch with class specialization to avoid VC++ bug

template < class DiscoverTimeMap > struct strong_comp_dispatch2
    {
        template < class Graph, class ComponentMap, class RootMap, class P,
            class T, class R >
        inline static typename property_traits< ComponentMap >::value_type
        apply(const Graph& g, ComponentMap comp, RootMap r_map,
            const bgl_named_params< P, T, R >& params, DiscoverTimeMap time_map)
        {
            return strong_components_impl(g, comp, r_map, time_map, params);
        }
    };

template <> struct strong_comp_dispatch2< param_not_found >
    {
        template < class Graph, class ComponentMap, class RootMap, class P,
            class T, class R >
        inline static typename property_traits< ComponentMap >::value_type
        apply(const Graph& g, ComponentMap comp, RootMap r_map,
            const bgl_named_params< P, T, R >& params, param_not_found)
        {
            typedef
                typename graph_traits< Graph >::vertices_size_type size_type;
            size_type n = num_vertices(g) > 0 ? num_vertices(g) : 1;
            std::vector< size_type > time_vec(n);
            return strong_components_impl(g, comp, r_map,
                make_iterator_property_map(time_vec.begin(),
                    choose_const_pmap(
                        get_param(params, vertex_index), g, vertex_index),
                    time_vec[0]),
                params);
        }
    };

template < class Graph, class ComponentMap, class RootMap, class P, class T,
        class R, class DiscoverTimeMap >
    inline typename property_traits< ComponentMap >::value_type scc_helper2(
        const Graph& g, ComponentMap comp, RootMap r_map,
        const bgl_named_params< P, T, R >& params, DiscoverTimeMap time_map)
    {
        return strong_comp_dispatch2< DiscoverTimeMap >::apply(
            g, comp, r_map, params, time_map);
    }

template < class RootMap > struct strong_comp_dispatch1
    {

template < class Graph, class ComponentMap, class P, class T, class R >
        inline static typename property_traits< ComponentMap >::value_type
        apply(const Graph& g, ComponentMap comp,
            const bgl_named_params< P, T, R >& params, RootMap r_map)
        {
            return scc_helper2(g, comp, r_map, params,
                get_param(params, vertex_discover_time));
        }
    };
    template <> struct strong_comp_dispatch1< param_not_found >
    {

template < class Graph, class ComponentMap, class P, class T, class R >
        inline static typename property_traits< ComponentMap >::value_type
        apply(const Graph& g, ComponentMap comp,
            const bgl_named_params< P, T, R >& params, param_not_found)
        {
            typedef typename graph_traits< Graph >::vertex_descriptor Vertex;
            typename std::vector< Vertex >::size_type n
                = num_vertices(g) > 0 ? num_vertices(g) : 1;
            std::vector< Vertex > root_vec(n);
            return scc_helper2(g, comp,
                make_iterator_property_map(root_vec.begin(),
                    choose_const_pmap(
                        get_param(params, vertex_index), g, vertex_index),
                    root_vec[0]),
                params, get_param(params, vertex_discover_time));
        }
    };

template < class Graph, class ComponentMap, class RootMap, class P, class T,
        class R >
    inline typename property_traits< ComponentMap >::value_type scc_helper1(
        const Graph& g, ComponentMap comp,
        const bgl_named_params< P, T, R >& params, RootMap r_map)
    {
        return detail::strong_comp_dispatch1< RootMap >::apply(
            g, comp, params, r_map);
    }

} // namespace detail

template < class Graph, class ComponentMap, class P, class T, class R >
inline typename property_traits< ComponentMap >::value_type strong_components(
    const Graph& g, ComponentMap comp,
    const bgl_named_params< P, T, R >& params BOOST_GRAPH_ENABLE_IF_MODELS_PARM(
        Graph, vertex_list_graph_tag))
{
    typedef typename graph_traits< Graph >::directed_category DirCat;
    BOOST_STATIC_ASSERT(
        (is_convertible< DirCat*, directed_tag* >::value == true));
    return detail::scc_helper1(
        g, comp, params, get_param(params, vertex_root_t()));
}

template < class Graph, class ComponentMap >
inline typename property_traits< ComponentMap >::value_type strong_components(
    const Graph& g,
    ComponentMap comp BOOST_GRAPH_ENABLE_IF_MODELS_PARM(
        Graph, vertex_list_graph_tag))
{
    typedef typename graph_traits< Graph >::directed_category DirCat;
    BOOST_STATIC_ASSERT(
        (is_convertible< DirCat*, directed_tag* >::value == true));
    bgl_named_params< int, int > params(0);
    return strong_components(g, comp, params);
}

template < typename Graph, typename ComponentMap, typename ComponentLists >
void build_component_lists(const Graph& g,
    typename graph_traits< Graph >::vertices_size_type num_scc,
    ComponentMap component_number, ComponentLists& components)
{
    components.resize(num_scc);
    typename graph_traits< Graph >::vertex_iterator vi, vi_end;
    for (boost::tie(vi, vi_end) = vertices(g); vi != vi_end; ++vi)
        components[component_number[*vi]].push_back(*vi);
}

} // namespace boost

#include <queue>
#include <vector>
#include <boost/graph/transpose_graph.hpp>
#include <boost/pending/indirect_cmp.hpp>
#include <boost/graph/connected_components.hpp> // for components_recorder

namespace boost
{

//==========================================================================
// This is the version of strongly connected components from
// "Intro. to Algorithms" by Cormen, Leiserson, Rivest, which was
// adapted from "Data Structure and Algorithms" by Aho, Hopcroft,
// and Ullman, who credit the algorithm to S.R. Kosaraju and M. Sharir.
// The algorithm is based on computing DFS forests the graph
// and its transpose.

// This algorithm is slower than Tarjan's by a constant factor, uses
// more memory, and puts more requirements on the graph type.

template < class Graph, class DFSVisitor, class ComponentsMap,
    class DiscoverTime, class FinishTime, class ColorMap >
typename property_traits< ComponentsMap >::value_type
kosaraju_strong_components(
    Graph& G, ComponentsMap c, FinishTime finish_time, ColorMap color)
{
    BOOST_CONCEPT_ASSERT((MutableGraphConcept< Graph >));
    // ...

typedef typename graph_traits< Graph >::vertex_descriptor Vertex;
    typedef typename property_traits< ColorMap >::value_type ColorValue;
    typedef color_traits< ColorValue > Color;
    typename property_traits< FinishTime >::value_type time = 0;
    depth_first_search(G,
        make_dfs_visitor(stamp_times(finish_time, time, on_finish_vertex())),
        color);

Graph G_T(num_vertices(G));
    transpose_graph(G, G_T);

typedef typename property_traits< ComponentsMap >::value_type count_type;

count_type c_count(0);
    detail::components_recorder< ComponentsMap > vis(c, c_count);

// initialize G_T
    typename graph_traits< Graph >::vertex_iterator ui, ui_end;
    for (boost::tie(ui, ui_end) = vertices(G_T); ui != ui_end; ++ui)
        put(color, *ui, Color::white());

typedef typename property_traits< FinishTime >::value_type D;
    typedef indirect_cmp< FinishTime, std::less< D > > Compare;

Compare fl(finish_time);
    std::priority_queue< Vertex, std::vector< Vertex >, Compare > Q(fl);

typename graph_traits< Graph >::vertex_iterator i, j, iend, jend;
    boost::tie(i, iend) = vertices(G_T);
    boost::tie(j, jend) = vertices(G);
    for (; i != iend; ++i, ++j)
    {
        put(finish_time, *i, get(finish_time, *j));
        Q.push(*i);
    }

while (!Q.empty())
    {
        Vertex u = Q.top();
        Q.pop();
        if (get(color, u) == Color::white())
        {
            depth_first_visit(G_T, u, vis, color);
            ++c_count;
        }
    }
    return c_count;
}

} // namespace boost

#include BOOST_GRAPH_MPI_INCLUDE(<boost/graph/distributed/strong_components.hpp>)

#endif // BOOST_GRAPH_STRONG_COMPONENTS_HPP

cmd: