stapl::dsssp_in_profiler_bgl< C, Counter > Class Template Reference

Public Member Functions
	dsssp_in_profiler_bgl (std::string pcname, C *pc, int argc=0, char **argv=NULL)
void	initialize_iteration ()
void	run ()
void	report (std::stringstream &ss)

Protected Attributes
C *	m_c
size_t	n_times

Detailed Description

template<class C, class Counter = counter<default_timer>>
class stapl::dsssp_in_profiler_bgl< C, Counter >

Profiler for DijkstraSSSP; expects the necessary data to be stored on the graph's vertices. The tags expected are vertex_distance_t and vertex_name_t. distance corresponds to... distance. name is for the predecessor/parent map parameter that holds the shortest paths. All the value types are expected to be size_t.

Problems will almost certainly occur if we change the vertex storage to std::list, since we get the vertex_index from within the graph, but boost's adjacency_list will not provide this automatically if vertex storage is std::list.

---

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

• bgl_profilers.h