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/metric_tsp_approx.hpp (10809B)

//=======================================================================
// Copyright 2008
// Author: Matyas W Egyhazy
//
// 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_METRIC_TSP_APPROX_HPP
#define BOOST_GRAPH_METRIC_TSP_APPROX_HPP

// metric_tsp_approx
// Generates an approximate tour solution for the traveling salesperson
// problem in polynomial time. The current algorithm guarantees a tour with a
// length at most as long as 2x optimal solution. The graph should have
// 'natural' (metric) weights such that the triangle inequality is maintained.
// Graphs must be fully interconnected.

// TODO:
// There are a couple of improvements that could be made.
// 1) Change implementation to lower uppper bound Christofides heuristic
// 2) Implement a less restrictive TSP heuristic (one that does not rely on
//    triangle inequality).
// 3) Determine if the algorithm can be implemented without creating a new
//    graph.

#include <vector>

#include <boost/shared_ptr.hpp>
#include <boost/concept_check.hpp>
#include <boost/graph/graph_traits.hpp>
#include <boost/graph/graph_as_tree.hpp>
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/prim_minimum_spanning_tree.hpp>
#include <boost/graph/lookup_edge.hpp>
#include <boost/throw_exception.hpp>

namespace boost
{
// Define a concept for the concept-checking library.
template < typename Visitor, typename Graph > struct TSPVertexVisitorConcept
{
private:
    Visitor vis_;

public:
    typedef typename graph_traits< Graph >::vertex_descriptor Vertex;

BOOST_CONCEPT_USAGE(TSPVertexVisitorConcept)
    {
        Visitor vis(vis_); // require copy construction
        Graph g(1);
        Vertex v(*vertices(g).first);
        vis.visit_vertex(v, g); // require visit_vertex
    }
};

// Tree visitor that keeps track of a preorder traversal of a tree
// TODO: Consider migrating this to the graph_as_tree header.
// TODO: Parameterize the underlying stores so it doesn't have to be a vector.
template < typename Node, typename Tree > class PreorderTraverser
{
private:
    std::vector< Node >& path_;

public:
    typedef typename std::vector< Node >::const_iterator const_iterator;

PreorderTraverser(std::vector< Node >& p) : path_(p) {}

void preorder(Node n, const Tree&) { path_.push_back(n); }

void inorder(Node, const Tree&) const {}
    void postorder(Node, const Tree&) const {}

const_iterator begin() const { return path_.begin(); }
    const_iterator end() const { return path_.end(); }
};

// Forward declarations
template < typename > class tsp_tour_visitor;
template < typename, typename, typename, typename > class tsp_tour_len_visitor;

template < typename VertexListGraph, typename OutputIterator >
void metric_tsp_approx_tour(VertexListGraph& g, OutputIterator o)
{
    metric_tsp_approx_from_vertex(g, *vertices(g).first, get(edge_weight, g),
        get(vertex_index, g), tsp_tour_visitor< OutputIterator >(o));
}

template < typename VertexListGraph, typename WeightMap,
    typename OutputIterator >
void metric_tsp_approx_tour(VertexListGraph& g, WeightMap w, OutputIterator o)
{
    metric_tsp_approx_from_vertex(
        g, *vertices(g).first, w, tsp_tour_visitor< OutputIterator >(o));
}

template < typename VertexListGraph, typename OutputIterator >
void metric_tsp_approx_tour_from_vertex(VertexListGraph& g,
    typename graph_traits< VertexListGraph >::vertex_descriptor start,
    OutputIterator o)
{
    metric_tsp_approx_from_vertex(g, start, get(edge_weight, g),
        get(vertex_index, g), tsp_tour_visitor< OutputIterator >(o));
}

template < typename VertexListGraph, typename WeightMap,
    typename OutputIterator >
void metric_tsp_approx_tour_from_vertex(VertexListGraph& g,
    typename graph_traits< VertexListGraph >::vertex_descriptor start,
    WeightMap w, OutputIterator o)
{
    metric_tsp_approx_from_vertex(g, start, w, get(vertex_index, g),
        tsp_tour_visitor< OutputIterator >(o));
}

template < typename VertexListGraph, typename TSPVertexVisitor >
void metric_tsp_approx(VertexListGraph& g, TSPVertexVisitor vis)
{
    metric_tsp_approx_from_vertex(
        g, *vertices(g).first, get(edge_weight, g), get(vertex_index, g), vis);
}

template < typename VertexListGraph, typename Weightmap,
    typename VertexIndexMap, typename TSPVertexVisitor >
void metric_tsp_approx(VertexListGraph& g, Weightmap w, TSPVertexVisitor vis)
{
    metric_tsp_approx_from_vertex(
        g, *vertices(g).first, w, get(vertex_index, g), vis);
}

template < typename VertexListGraph, typename WeightMap,
    typename VertexIndexMap, typename TSPVertexVisitor >
void metric_tsp_approx(
    VertexListGraph& g, WeightMap w, VertexIndexMap id, TSPVertexVisitor vis)
{
    metric_tsp_approx_from_vertex(g, *vertices(g).first, w, id, vis);
}

template < typename VertexListGraph, typename WeightMap,
    typename TSPVertexVisitor >
void metric_tsp_approx_from_vertex(VertexListGraph& g,
    typename graph_traits< VertexListGraph >::vertex_descriptor start,
    WeightMap w, TSPVertexVisitor vis)
{
    metric_tsp_approx_from_vertex(g, start, w, get(vertex_index, g), vis);
}

template < typename VertexListGraph, typename WeightMap,
    typename VertexIndexMap, typename TSPVertexVisitor >
void metric_tsp_approx_from_vertex(const VertexListGraph& g,
    typename graph_traits< VertexListGraph >::vertex_descriptor start,
    WeightMap weightmap, VertexIndexMap indexmap, TSPVertexVisitor vis)
{
    using namespace boost;
    using namespace std;

BOOST_CONCEPT_ASSERT((VertexListGraphConcept< VertexListGraph >));
    BOOST_CONCEPT_ASSERT(
        (TSPVertexVisitorConcept< TSPVertexVisitor, VertexListGraph >));

// Types related to the input graph (GVertex is a template parameter).
    typedef typename graph_traits< VertexListGraph >::vertex_descriptor GVertex;
    typedef typename graph_traits< VertexListGraph >::vertex_iterator GVItr;

// We build a custom graph in this algorithm.
    typedef adjacency_list< vecS, vecS, directedS, no_property, no_property >
        MSTImpl;
    typedef graph_traits< MSTImpl >::vertex_descriptor Vertex;
    typedef graph_traits< MSTImpl >::vertex_iterator VItr;

// And then re-cast it as a tree.
    typedef iterator_property_map< vector< Vertex >::iterator,
        property_map< MSTImpl, vertex_index_t >::type >
        ParentMap;
    typedef graph_as_tree< MSTImpl, ParentMap > Tree;
    typedef tree_traits< Tree >::node_descriptor Node;

// A predecessor map.
    typedef vector< GVertex > PredMap;
    typedef iterator_property_map< typename PredMap::iterator, VertexIndexMap >
        PredPMap;

PredMap preds(num_vertices(g));
    PredPMap pred_pmap(preds.begin(), indexmap);

// Compute a spanning tree over the in put g.
    prim_minimum_spanning_tree(g, pred_pmap,
        root_vertex(start).vertex_index_map(indexmap).weight_map(weightmap));

// Build a MST using the predecessor map from prim mst
    MSTImpl mst(num_vertices(g));
    std::size_t cnt = 0;
    pair< VItr, VItr > mst_verts(vertices(mst));
    for (typename PredMap::iterator vi(preds.begin()); vi != preds.end();
         ++vi, ++cnt)
    {
        if (indexmap[*vi] != cnt)
        {
            add_edge(*next(mst_verts.first, indexmap[*vi]),
                *next(mst_verts.first, cnt), mst);
        }
    }

// Build a tree abstraction over the MST.
    vector< Vertex > parent(num_vertices(mst));
    Tree t(mst, *vertices(mst).first,
        make_iterator_property_map(parent.begin(), get(vertex_index, mst)));

// Create tour using a preorder traversal of the mst
    vector< Node > tour;
    PreorderTraverser< Node, Tree > tvis(tour);
    traverse_tree(indexmap[start], t, tvis);

pair< GVItr, GVItr > g_verts(vertices(g));
    for (PreorderTraverser< Node, Tree >::const_iterator curr(tvis.begin());
         curr != tvis.end(); ++curr)
    {
        // TODO: This is will be O(n^2) if vertex storage of g != vecS.
        GVertex v = *next(g_verts.first, get(vertex_index, mst)[*curr]);
        vis.visit_vertex(v, g);
    }

// Connect back to the start of the tour
    vis.visit_vertex(start, g);
}

// Default tsp tour visitor that puts the tour in an OutputIterator
template < typename OutItr > class tsp_tour_visitor
{
    OutItr itr_;

public:
    tsp_tour_visitor(OutItr itr) : itr_(itr) {}

template < typename Vertex, typename Graph >
    void visit_vertex(Vertex v, const Graph&)
    {
        BOOST_CONCEPT_ASSERT((OutputIterator< OutItr, Vertex >));
        *itr_++ = v;
    }
};

// Tsp tour visitor that adds the total tour length.
template < typename Graph, typename WeightMap, typename OutIter,
    typename Length >
class tsp_tour_len_visitor
{
    typedef typename graph_traits< Graph >::vertex_descriptor Vertex;
    BOOST_CONCEPT_ASSERT((OutputIterator< OutIter, Vertex >));

OutIter iter_;
    Length& tourlen_;
    WeightMap& wmap_;
    Vertex previous_;

// Helper function for getting the null vertex.
    Vertex null() { return graph_traits< Graph >::null_vertex(); }

public:
    tsp_tour_len_visitor(Graph const&, OutIter iter, Length& l, WeightMap& map)
    : iter_(iter), tourlen_(l), wmap_(map), previous_(null())
    {
    }

void visit_vertex(Vertex v, const Graph& g)
    {
        typedef typename graph_traits< Graph >::edge_descriptor Edge;

// If it is not the start, then there is a
        // previous vertex
        if (previous_ != null())
        {
            // NOTE: For non-adjacency matrix graphs g, this bit of code
            // will be linear in the degree of previous_ or v. A better
            // solution would be to visit edges of the graph, but that
            // would require revisiting the core algorithm.
            Edge e;
            bool found;
            boost::tie(e, found) = lookup_edge(previous_, v, g);
            if (!found)
            {
                BOOST_THROW_EXCEPTION(not_complete());
            }

tourlen_ += wmap_[e];
        }

previous_ = v;
        *iter_++ = v;
    }
};

// Object generator(s)
template < typename OutIter >
inline tsp_tour_visitor< OutIter > make_tsp_tour_visitor(OutIter iter)
{
    return tsp_tour_visitor< OutIter >(iter);
}

template < typename Graph, typename WeightMap, typename OutIter,
    typename Length >
inline tsp_tour_len_visitor< Graph, WeightMap, OutIter, Length >
make_tsp_tour_len_visitor(
    Graph const& g, OutIter iter, Length& l, WeightMap map)
{
    return tsp_tour_len_visitor< Graph, WeightMap, OutIter, Length >(
        g, iter, l, map);
}

} // boost

#endif // BOOST_GRAPH_METRIC_TSP_APPROX_HPP

cmd: