FM / detail

/usr/include/boost/graph/detail

Name	Size	Mode	Actions
adjacency_list.hpp	106090	0644	edit dl rm
adj_list_edge_iterator.hpp	3987	0644	edit dl rm
array_binary_tree.hpp	7015	0644	edit dl rm
augment.hpp	2293	0644	edit dl rm
compressed_sparse_row_struct.hpp	30100	0644	edit dl rm
connected_components.hpp	6716	0644	edit dl rm
d_ary_heap.hpp	12255	0644	edit dl rm
edge.hpp	3550	0644	edit dl rm
empty_header.hpp	383	0644	edit dl rm
geodesic.hpp	4825	0644	edit dl rm
histogram_sort.hpp	13020	0644	edit dl rm
incidence_iterator.hpp	2681	0644	edit dl rm
incremental_components.hpp	3187	0644	edit dl rm
index.hpp	2623	0644	edit dl rm
indexed_properties.hpp	9420	0644	edit dl rm
is_distributed_selector.hpp	855	0644	edit dl rm
labeled_graph_traits.hpp	6618	0644	edit dl rm
list_base.hpp	5614	0644	edit dl rm
mpi_include.hpp	536	0644	edit dl rm
permutation.hpp	6020	0644	edit dl rm
read_graphviz_new.hpp	3555	0644	edit dl rm
read_graphviz_spirit.hpp	28019	0644	edit dl rm
self_avoiding_walk.hpp	15856	0644	edit dl rm
set_adaptor.hpp	3092	0644	edit dl rm
shadow_iterator.hpp	5497	0644	edit dl rm
sparse_ordering.hpp	6345	0644	edit dl rm

Edit: /usr/include/boost/graph/detail/index.hpp (2623B)

#ifndef BOOST_GRAPH_DETAIL_INDEX_HPP
#define BOOST_GRAPH_DETAIL_INDEX_HPP

#include <boost/graph/graph_traits.hpp>

// The structures in this module are responsible for selecting and defining
// types for accessing a builting index map. Note that the selection of these
// types requires the Graph parameter to model either VertexIndexGraph or
// EdgeIndexGraph.

namespace boost
{
namespace detail
{
    template < typename Graph > struct vertex_indexer
    {
        typedef vertex_index_t index_type;
        typedef typename property_map< Graph, vertex_index_t >::type map_type;
        typedef typename property_map< Graph, vertex_index_t >::const_type
            const_map_type;
        typedef typename property_traits< map_type >::value_type value_type;
        typedef typename graph_traits< Graph >::vertex_descriptor key_type;

static const_map_type index_map(const Graph& g)
        {
            return get(vertex_index, g);
        }

static map_type index_map(Graph& g) { return get(vertex_index, g); }

static value_type index(key_type k, const Graph& g)
        {
            return get(vertex_index, g, k);
        }
    };

template < typename Graph > struct edge_indexer
    {
        typedef edge_index_t index_type;
        typedef typename property_map< Graph, edge_index_t >::type map_type;
        typedef typename property_map< Graph, edge_index_t >::const_type
            const_map_type;
        typedef typename property_traits< map_type >::value_type value_type;
        typedef typename graph_traits< Graph >::edge_descriptor key_type;

static const_map_type index_map(const Graph& g)
        {
            return get(edge_index, g);
        }

static map_type index_map(Graph& g) { return get(edge_index, g); }

static value_type index(key_type k, const Graph& g)
        {
            return get(edge_index, g, k);
        }
    };

// NOTE: The Graph parameter MUST be a model of VertexIndexGraph or
    // VertexEdgeGraph - whichever type Key is selecting.
    template < typename Graph, typename Key > struct choose_indexer
    {
        typedef typename mpl::if_<
            is_same< Key, typename graph_traits< Graph >::vertex_descriptor >,
            vertex_indexer< Graph >, edge_indexer< Graph > >::type indexer_type;
        typedef typename indexer_type::index_type index_type;
    };
}
}

#endif

// (C) Copyright 2007-2009 Andrew Sutton // // Use, modification and distribution are subject to the // Boost Software License, Version 1.0 (See accompanying file // LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) #ifndef BOOST_GRAPH_DETAIL_INDEX_HPP #define BOOST_GRAPH_DETAIL_INDEX_HPP #include // The structures in this module are responsible for selecting and defining // types for accessing a builting index map. Note that the selection of these // types requires the Graph parameter to model either VertexIndexGraph or // EdgeIndexGraph. namespace boost { namespace detail { template < typename Graph > struct vertex_indexer { typedef vertex_index_t index_type; typedef typename property_map< Graph, vertex_index_t >::type map_type; typedef typename property_map< Graph, vertex_index_t >::const_type const_map_type; typedef typename property_traits< map_type >::value_type value_type; typedef typename graph_traits< Graph >::vertex_descriptor key_type; static const_map_type index_map(const Graph& g) { return get(vertex_index, g); } static map_type index_map(Graph& g) { return get(vertex_index, g); } static value_type index(key_type k, const Graph& g) { return get(vertex_index, g, k); } }; template < typename Graph > struct edge_indexer { typedef edge_index_t index_type; typedef typename property_map< Graph, edge_index_t >::type map_type; typedef typename property_map< Graph, edge_index_t >::const_type const_map_type; typedef typename property_traits< map_type >::value_type value_type; typedef typename graph_traits< Graph >::edge_descriptor key_type; static const_map_type index_map(const Graph& g) { return get(edge_index, g); } static map_type index_map(Graph& g) { return get(edge_index, g); } static value_type index(key_type k, const Graph& g) { return get(edge_index, g, k); } }; // NOTE: The Graph parameter MUST be a model of VertexIndexGraph or // VertexEdgeGraph - whichever type Key is selecting. template < typename Graph, typename Key > struct choose_indexer { typedef typename mpl::if_< is_same< Key, typename graph_traits< Graph >::vertex_descriptor >, vertex_indexer< Graph >, edge_indexer< Graph > >::type indexer_type; typedef typename indexer_type::index_type index_type; }; } } #endif