/usr/include/boost/graph/distributed
NameSizeModeActions
adjlist/-0755rm
detail/-0755rm
adjacency_list.hpp1497770644editdlrm
betweenness_centrality.hpp701320644editdlrm
boman_et_al_graph_coloring.hpp129870644editdlrm
breadth_first_search.hpp52090644editdlrm
compressed_sparse_row_graph.hpp818050644editdlrm
concepts.hpp70280644editdlrm
connected_components.hpp284010644editdlrm
connected_components_parallel_search.hpp150590644editdlrm
crauser_et_al_shortest_paths.hpp253420644editdlrm
dehne_gotz_min_spanning_tree.hpp386870644editdlrm
delta_stepping_shortest_paths.hpp194150644editdlrm
depth_first_search.hpp104370644editdlrm
dijkstra_shortest_paths.hpp87190644editdlrm
distributed_graph_utility.hpp45600644editdlrm
eager_dijkstra_shortest_paths.hpp162940644editdlrm
filtered_graph.hpp19430644editdlrm
fruchterman_reingold.hpp129630644editdlrm
graphviz.hpp86720644editdlrm
hohberg_biconnected_components.hpp380930644editdlrm
local_subgraph.hpp60570644editdlrm
mpi_process_group.hpp265920644editdlrm
named_graph.hpp481620644editdlrm
one_bit_color_map.hpp40460644editdlrm
page_rank.hpp80030644editdlrm
queue.hpp102490644editdlrm
reverse_graph.hpp12230644editdlrm
rmat_graph_generator.hpp59130644editdlrm
selector.hpp13750644editdlrm
shuffled_distribution.hpp28330644editdlrm
strong_components.hpp403960644editdlrm
st_connected.hpp61580644editdlrm
two_bit_color_map.hpp40410644editdlrm
unsafe_serialize.hpp3800644editdlrm
vertex_list_adaptor.hpp162520644editdlrm
Edit: /usr/include/boost/graph/distributed/graphviz.hpp (8672B)
// Copyright (C) 2004-2006 The Trustees of Indiana University. // Use, modification and distribution is subject to 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) // Authors: Douglas Gregor // Andrew Lumsdaine #ifndef BOOST_GRAPH_PARALLEL_GRAPHVIZ_HPP #define BOOST_GRAPH_PARALLEL_GRAPHVIZ_HPP #ifndef BOOST_GRAPH_USE_MPI #error "Parallel BGL files should not be included unless has been included" #endif #include #include #include #include #include #include #include #include #include #include #include #include #include namespace boost { template struct graph_id_writer { explicit graph_id_writer(const Graph& g) : g(g) { } void operator()(std::ostream& out) { out << " label=\"p" << process_id(g.process_group()) << "\";\n"; } private: const Graph& g; }; template struct paint_by_number_writer { explicit paint_by_number_writer(NumberMap number) : number(number) { } template void operator()(std::ostream& out, Descriptor k) { static const char* color_names[] = { "blue", "brown", "cyan", "darkgreen", "darkorchid", "darksalmon", "darkviolet", "deeppink", "gold3", "green", "magenta", "navy", "red", "yellow", "palegreen", "gray65", "gray21", "bisque2", "greenyellow", "indianred4", "lightblue2", "mediumspringgreen", "orangered", "orange" }; const int colors = sizeof(color_names) / sizeof(color_names[0]); if (get(number, k) < colors) { out << " [ style=\"filled\", fillcolor=\"" << color_names[get(number, k)] << "\" ]"; } else { out << " [ label=\"(" << get(number, k) << ")\" ]"; } } private: NumberMap number; }; template inline paint_by_number_writer paint_by_number(NumberMap number) { return paint_by_number_writer(number); } template void write_graphviz(std::ostream& out, const Graph& g, VertexPropertiesWriter vpw, EdgePropertiesWriter epw, GraphPropertiesWriter gpw BOOST_GRAPH_ENABLE_IF_MODELS_PARM(Graph,distributed_graph_tag)) { typedef typename graph_traits::directed_category directed_category; typedef typename boost::graph::parallel::process_group_type::type process_group_type; typedef typename property_map::const_type VertexIndexMap; typedef typename property_map::const_type VertexGlobalMap; static const bool is_undirected = (is_base_and_derived::value || is_same::value); static const char* graph_kind = is_undirected? "graph" : "digraph"; static const char* edge_kind = is_undirected? "--" : "->"; using boost::graph::parallel::process_group; process_group_type pg = process_group(g); parallel::global_index_map global_index(pg, num_vertices(g), get(vertex_index, g), get(vertex_global, g)); std::ostringstream local_graph_out; local_graph_out << " subgraph cluster_" << process_id(pg) << " {\n"; gpw(local_graph_out); typename graph_traits::vertex_iterator vi, vi_end; for (boost::tie(vi, vi_end) = vertices(g); vi != vi_end; ++vi) { int global_idx = get(global_index, *vi); local_graph_out << " n" << global_idx; vpw(local_graph_out, *vi); local_graph_out << ";\n"; } local_graph_out << " }\n\n"; typename graph_traits::edge_iterator ei, ei_end; for (boost::tie(ei, ei_end) = edges(g); ei != ei_end; ++ei) { int source_idx = get(global_index, source(*ei, g)); int target_idx = get(global_index, target(*ei, g)); local_graph_out << " n" << source_idx << " " << edge_kind << " n" << target_idx; epw(local_graph_out, *ei); local_graph_out << ";\n"; } if (process_id(pg) == 0) { out << graph_kind << " g {\n"; out << local_graph_out.str(); synchronize(pg); for (int i = 1; i < num_processes(pg); ++i) { int len; receive(pg, i, 0, len); char* data = new char [len+1]; data[len] = 0; receive(pg, i, 1, data, len); out << std::endl << data; delete [] data; } out << "}\n"; } else { std::string result_str = local_graph_out.str(); const char* data = result_str.c_str(); int len = result_str.length(); send(pg, 0, 0, len); send(pg, 0, 1, data, len); synchronize(pg); } synchronize(pg); synchronize(pg); synchronize(pg); } template inline void write_graphviz(std::ostream& out, const Graph& g, VertexPropertiesWriter vpw, EdgePropertiesWriter epw BOOST_GRAPH_ENABLE_IF_MODELS_PARM(Graph,distributed_graph_tag)) { write_graphviz(out, g, vpw, epw, graph_id_writer(g)); } template inline void write_graphviz(std::ostream& out, const Graph& g, VertexPropertiesWriter vpw BOOST_GRAPH_ENABLE_IF_MODELS_PARM(Graph,distributed_graph_tag)) { write_graphviz(out, g, vpw, default_writer()); } template inline void write_graphviz(std::ostream& out, const Graph& g BOOST_GRAPH_ENABLE_IF_MODELS_PARM(Graph,distributed_graph_tag)) { write_graphviz(out, g, default_writer()); } template void write_graphviz(const std::string& filename, const Graph& g, VertexPropertiesWriter vpw, EdgePropertiesWriter epw, GraphPropertiesWriter gpw BOOST_GRAPH_ENABLE_IF_MODELS_PARM(Graph,distributed_graph_tag)) { if (process_id(g.process_group()) == 0) { std::ofstream out(filename.c_str()); write_graphviz(out, g, vpw, epw, gpw); } else { write_graphviz(std::cout, g, vpw, epw, gpw); } } template void write_graphviz(const std::string& filename, const Graph& g, VertexPropertiesWriter vpw, EdgePropertiesWriter epw BOOST_GRAPH_ENABLE_IF_MODELS_PARM(Graph,distributed_graph_tag)) { if (process_id(g.process_group()) == 0) { std::ofstream out(filename.c_str()); write_graphviz(out, g, vpw, epw); } else { write_graphviz(std::cout, g, vpw, epw); } } template void write_graphviz(const std::string& filename, const Graph& g, VertexPropertiesWriter vpw BOOST_GRAPH_ENABLE_IF_MODELS_PARM(Graph,distributed_graph_tag)) { if (process_id(g.process_group()) == 0) { std::ofstream out(filename.c_str()); write_graphviz(out, g, vpw); } else { write_graphviz(std::cout, g, vpw); } } template void write_graphviz(const std::string& filename, const Graph& g BOOST_GRAPH_ENABLE_IF_MODELS_PARM(Graph,distributed_graph_tag)) { if (process_id(g.process_group()) == 0) { std::ofstream out(filename.c_str()); write_graphviz(out, g); } else { write_graphviz(std::cout, g); } } template void write_graphviz(std::ostream& out, const Graph& g, const dynamic_properties& dp, const std::string& node_id = "node_id" BOOST_GRAPH_ENABLE_IF_MODELS_PARM(Graph,distributed_graph_tag)) { write_graphviz (out, g, /*vertex_writer=*/dynamic_vertex_properties_writer(dp, node_id), /*edge_writer=*/dynamic_properties_writer(dp)); } } // end namespace boost #endif // BOOST_GRAPH_PARALLEL_GRAPHVIZ_HPP