OpenMS
IDBoostGraph::dfs_ccsplit_visitor Class Reference

A boost dfs visitor that copies connected components into a vector of graphs. More...

#include <OpenMS/ANALYSIS/ID/IDBoostGraph.h>

Inheritance diagram for IDBoostGraph::dfs_ccsplit_visitor:
[legend]
Collaboration diagram for IDBoostGraph::dfs_ccsplit_visitor:
[legend]

Public Member Functions

 dfs_ccsplit_visitor (Graphs &vgs)
 
template<typename Vertex , typename Graph >
void start_vertex (Vertex u, const Graph &tg)
 
template<typename Vertex , typename Graph >
void discover_vertex (Vertex, const Graph &)
 
template<typename Edge , typename Graph >
void examine_edge (Edge e, const Graph &tg)
 

Public Attributes

Graphsgs
 
vertex_t curr_v
 
vertex_t next_v
 
std::map< vertex_t, vertex_tm
 A mapping from old node id to new node id to not duplicate existing ones in the new graph. More...
 

Detailed Description

A boost dfs visitor that copies connected components into a vector of graphs.

Constructor & Destructor Documentation

◆ dfs_ccsplit_visitor()

dfs_ccsplit_visitor ( Graphs vgs)
inline

Member Function Documentation

◆ discover_vertex()

void discover_vertex ( Vertex  ,
const Graph  
)
inline

◆ examine_edge()

void examine_edge ( Edge  e,
const Graph tg 
)
inline

◆ start_vertex()

void start_vertex ( Vertex  u,
const Graph tg 
)
inline

Member Data Documentation

◆ curr_v

vertex_t curr_v

◆ gs

Graphs& gs

◆ m

std::map<vertex_t, vertex_t> m

A mapping from old node id to new node id to not duplicate existing ones in the new graph.

◆ next_v

vertex_t next_v