123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113 |
- // (C) Copyright Andrew Sutton 2007
- //
- // 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_EXAMPLE_HELPER_HPP
- #define BOOST_GRAPH_EXAMPLE_HELPER_HPP
- #include <string>
- #include <sstream>
- #include <map>
- #include <algorithm>
- #include <boost/graph/properties.hpp>
- template <typename Graph, typename NameMap, typename VertexMap>
- typename boost::graph_traits<Graph>::vertex_descriptor
- add_named_vertex(Graph& g, NameMap nm, const std::string& name, VertexMap& vm)
- {
- typedef typename boost::graph_traits<Graph>::vertex_descriptor Vertex;
- typedef typename VertexMap::iterator Iterator;
- Vertex v;
- Iterator iter;
- bool inserted;
- boost::tie(iter, inserted) = vm.insert(make_pair(name, Vertex()));
- if(inserted) {
- // The name was unique so we need to add a vertex to the graph
- v = add_vertex(g);
- iter->second = v;
- put(nm, v, name); // store the name in the name map
- }
- else {
- // We had alread inserted this name so we can return the
- // associated vertex.
- v = iter->second;
- }
- return v;
- }
- template <typename Graph, typename NameMap, typename InputStream>
- inline std::map<std::string, typename boost::graph_traits<Graph>::vertex_descriptor>
- read_graph(Graph& g, NameMap nm, InputStream& is)
- {
- typedef typename boost::graph_traits<Graph>::vertex_descriptor Vertex;
- std::map<std::string, Vertex> verts;
- for(std::string line; std::getline(is, line); ) {
- if(line.empty()) continue;
- std::size_t index = line.find_first_of(',');
- std::string first(line, 0, index);
- std::string second(line, index + 1);
- Vertex u = add_named_vertex(g, nm, first, verts);
- Vertex v = add_named_vertex(g, nm, second, verts);
- add_edge(u, v, g);
- }
- return verts;
- }
- template <typename Graph, typename InputStream>
- inline std::map<std::string, typename boost::graph_traits<Graph>::vertex_descriptor>
- read_graph(Graph& g, InputStream& is)
- {
- typedef typename boost::graph_traits<Graph>::vertex_descriptor Vertex;
- typedef boost::null_property_map<Vertex, std::string> NameMap;
- return read_graph(g, NameMap(), is);
- }
- template <typename Graph, typename NameMap, typename WeightMap, typename InputStream>
- inline std::map<std::string, typename boost::graph_traits<Graph>::vertex_descriptor>
- read_weighted_graph(Graph& g, NameMap nm, WeightMap wm, InputStream& is)
- {
- typedef typename boost::graph_traits<Graph>::vertex_descriptor Vertex;
- typedef typename boost::graph_traits<Graph>::edge_descriptor Edge;
- std::map<std::string, Vertex> verts;
- for(std::string line; std::getline(is, line); ) {
- if(line.empty()) continue;
- std::size_t i = line.find_first_of(',');
- std::size_t j = line.find_first_of(',', i + 1);
- std::string first(line, 0, i);
- std::string second(line, i + 1, j - i - 1);
- std::string prob(line, j + 1);
- // convert the probability to a float
- std::stringstream ss(prob);
- float p;
- ss >> p;
- // add the vertices to the graph
- Vertex u = add_named_vertex(g, nm, first, verts);
- Vertex v = add_named_vertex(g, nm, second, verts);
- // add the edge and set the weight
- Edge e = add_edge(u, v, g).first;
- put(wm, e, p);
- }
- return verts;
- }
- template <typename Graph, typename WeightMap, typename InputStream>
- inline std::map<std::string, typename boost::graph_traits<Graph>::vertex_descriptor>
- read_weighted_graph(Graph& g, WeightMap wm, InputStream& is)
- {
- typedef typename boost::graph_traits<Graph>::vertex_descriptor Vertex;
- typedef boost::null_property_map<Vertex, std::string> NameMap;
- return read_weighted_graph(g, NameMap(), wm, is);
- }
- #endif
|