SCIL::CUT< Graph >::bfs_dist_visitor< Graph > Class Template Reference

Visitor for algorithm boost::breadth_first_search.

List of all members.

Public Member Functions
	bfs_dist_visitor (map< vertex_descriptor, int > *_distmap, list< vertex_descriptor > *_bfs_order, int start_vertex)
void	tree_edge (edge_descriptor e, const Graph &G) const
	This event is called when a new vertex is discovered.
void	discover_vertex (vertex_descriptor u, const Graph &G) const
	This event is called when a new vertex is disoverd.
Public Attributes
map< vertex_descriptor, int > *	distmap
	Stores the distances of the vertices from the start vertex.
list< vertex_descriptor > *	bfs_order
	Vertices discoverd during run of BFS ordered by discovery time.

---

Detailed Description

template<typename Graph>
template<typename Graph>
class SCIL::CUT< Graph >::bfs_dist_visitor< Graph >

Definition at line 16 of file cut.cc.

---

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

• cut.cc