WireCell::IndexedGraph< VertexType > Class Template Reference

#include <IndexedGraph.h>

Public Types
typedef VertexType	vertex_t
typedef boost::adjacency_list< boost::setS, boost::vecS, boost::undirectedS, vertex_t >	graph_t
typedef boost::graph_traits< graph_t >::vertex_descriptor	vdesc_t
typedef boost::graph_traits< graph_t >::edge_descriptor	edesc_t
typedef std::unordered_map< int, std::vector< vertex_t > >	vertex_grouping_t
	Return connected component subgraphs. More...
typedef std::unordered_map< vertex_t, vdesc_t >	index_t

Public Member Functions
	IndexedGraph ()
	IndexedGraph (const graph_t &g)
std::vector< vertex_t >	neighbors (vertex_t obj) const
bool	has (vertex_t vobj) const
edesc_t	edge (vertex_t vobj1, vertex_t vobj2)
vdesc_t	vertex (vertex_t vobj)
vdesc_t	replace (vertex_t vold, vertex_t vnew)
void	clear ()
vertex_grouping_t	groups ()
const graph_t &	graph () const
graph_t &	graph ()
index_t &	index ()
const index_t &	index () const

Private Attributes
graph_t	m_graph
index_t	m_index

Detailed Description

template<typename VertexType>
class WireCell::IndexedGraph< VertexType >

Definition at line 31 of file IndexedGraph.h.

Member Typedef Documentation

template<typename VertexType>

typedef boost::graph_traits<graph_t>::edge_descriptor WireCell::IndexedGraph< VertexType >::edesc_t

Definition at line 46 of file IndexedGraph.h.

template<typename VertexType>

typedef boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, vertex_t> WireCell::IndexedGraph< VertexType >::graph_t

Definition at line 44 of file IndexedGraph.h.

template<typename VertexType>

typedef std::unordered_map<vertex_t, vdesc_t> WireCell::IndexedGraph< VertexType >::index_t

Definition at line 149 of file IndexedGraph.h.

template<typename VertexType>

typedef boost::graph_traits<graph_t>::vertex_descriptor WireCell::IndexedGraph< VertexType >::vdesc_t

Definition at line 45 of file IndexedGraph.h.

template<typename VertexType>

typedef std::unordered_map<int, std::vector<vertex_t> > WireCell::IndexedGraph< VertexType >::vertex_grouping_t

Return connected component subgraphs.

Definition at line 128 of file IndexedGraph.h.

template<typename VertexType>

typedef VertexType WireCell::IndexedGraph< VertexType >::vertex_t

Definition at line 33 of file IndexedGraph.h.

Constructor & Destructor Documentation

template<typename VertexType>

WireCell::IndexedGraph< VertexType >::IndexedGraph ( )

inline

Definition at line 48 of file IndexedGraph.h.

{}

template<typename VertexType>

WireCell::IndexedGraph< VertexType >::IndexedGraph ( const graph_t &  g )

inline

Definition at line 50 of file IndexedGraph.h.

                                       {

            // can't do straight copy() with setS unless give vertex index map.
            typedef std::unordered_map<vdesc_t, size_t> vertex_map_t;
            vertex_map_t vmap;
            boost::associative_property_map<vertex_map_t> pmapindx(vmap);
            int count = 0;
            for (auto v : boost::make_iterator_range(boost::vertices(g))) {
                boost::put(pmapindx, v, count++);
            }
            boost::copy_graph(g, m_graph, boost::vertex_index_map( pmapindx ) );

            // make index
            for (auto v : boost::make_iterator_range(boost::vertices(m_graph))) {
                m_index[m_graph[v]] = v;
            }
        }

Member Function Documentation

template<typename VertexType>

void WireCell::IndexedGraph< VertexType >::clear ( void  )

inline

Definition at line 121 of file IndexedGraph.h.

                     {
            m_index.clear();
            m_graph.clear();
        }

template<typename VertexType>

edesc_t WireCell::IndexedGraph< VertexType >::edge ( vertex_t  vobj1, vertex_t  vobj2  )

inline

Definition at line 93 of file IndexedGraph.h.

                                                     {
            vdesc_t v1 = vertex(vobj1);
            vdesc_t v2 = vertex(vobj2);
            auto ret = boost::add_edge(v1, v2, m_graph);
            return ret.first;
        }

template<typename VertexType>

const graph_t& WireCell::IndexedGraph< VertexType >::graph ( ) const

inline

Definition at line 141 of file IndexedGraph.h.

{ return m_graph; }

template<typename VertexType>

graph_t& WireCell::IndexedGraph< VertexType >::graph ( )

inline

Definition at line 145 of file IndexedGraph.h.

{ return m_graph; }

template<typename VertexType>

vertex_grouping_t WireCell::IndexedGraph< VertexType >::groups ( )

inline

Definition at line 129 of file IndexedGraph.h.

                                   {
            std::unordered_map<vdesc_t, int> stripes;
            boost::connected_components(m_graph,
                                        boost::make_assoc_property_map(stripes));
            vertex_grouping_t ret;
            for (auto& vg : stripes) { // invert
                ret[vg.second].push_back(m_graph[vg.first]);
            }
            return ret;
        }

template<typename VertexType>

bool WireCell::IndexedGraph< VertexType >::has ( vertex_t  vobj ) const

inline

Definition at line 84 of file IndexedGraph.h.

                                      {
            auto it = m_index.find(vobj);
            if (it == m_index.end()) {
                return false;
            }
            return true;
        }

template<typename VertexType>

index_t& WireCell::IndexedGraph< VertexType >::index ( )

inline

Definition at line 150 of file IndexedGraph.h.

{ return m_index; }

template<typename VertexType>

const index_t& WireCell::IndexedGraph< VertexType >::index ( ) const

inline

Definition at line 151 of file IndexedGraph.h.

{ return m_index; }

template<typename VertexType>

std::vector<vertex_t> WireCell::IndexedGraph< VertexType >::neighbors ( vertex_t  obj ) const

inline

Definition at line 69 of file IndexedGraph.h.

                                                          {
            std::vector<vertex_t> ret;
            auto it = m_index.find(obj);
            if (it == m_index.end()) {
                return ret;
            }
            vdesc_t vd = it->second;
            for (auto edge : boost::make_iterator_range(boost::out_edges(vd, m_graph))) {
                vdesc_t neigh = boost::target(edge, m_graph);
                ret.push_back(m_graph[neigh]);
            }
            return ret;
        }

template<typename VertexType>

vdesc_t WireCell::IndexedGraph< VertexType >::replace ( vertex_t  vold, vertex_t  vnew  )

inline

Definition at line 113 of file IndexedGraph.h.

                                                      {
            auto vd = vertex(vold);
            m_graph[vd] = vnew;
            m_index[vnew] = vd;
            return vd;
        }

template<typename VertexType>

vdesc_t WireCell::IndexedGraph< VertexType >::vertex ( vertex_t  vobj )

inline

Definition at line 101 of file IndexedGraph.h.

                                      {
            auto it = m_index.find(vobj);
            if (it != m_index.end()) {
                return it->second;
            }
            vdesc_t vd = boost::add_vertex(vobj, m_graph);
            m_index[vobj] = vd;
            return vd;
        }

Member Data Documentation

template<typename VertexType>

graph_t WireCell::IndexedGraph< VertexType >::m_graph

private

Definition at line 154 of file IndexedGraph.h.

template<typename VertexType>

index_t WireCell::IndexedGraph< VertexType >::m_index

private

Definition at line 155 of file IndexedGraph.h.

---

The documentation for this class was generated from the following file:

• wire-cell-build/util/inc/WireCellUtil/IndexedGraph.h