Re: [Boost-Users] breadth_first_searchable graph, without invalidable vertex descriptors

From: Jeremy Siek (jsiek_at_[hidden])
Date: 2001-11-20 22:44:24

Hi Cristy,

On Wed, 21 Nov 2001 cristipp_at_[hidden] wrote:
cristi> I am trying to use the BCG as backbone for a ControlFlowGraph in a
cristi> compiler project. It seems that I cannot use BCG for this task
cristi> because of the follow contradicting (from BCG point of view)
cristi> requirements:

What is BCG? I will assume you mean the boost::adjacency_list class.

cristi> 1. I want to be able to breadth_first_search through my graph.
cristi> 2. I want to be able to keep descriptors to vertices 'for ever' so I
cristi> can refer a specific vertex at any given time (for removal or
cristi> whatever other reasons).
cristi>
cristi> To implement requirement 1 my adjacency_list should have its
cristi> VertexList of type vecS.

This is not required. The VertexList can be listS. However, you do need
to provide your own color map parameter if you use listS.

Cheers,
Jeremy

----------------------------------------------------------------------
 Jeremy Siek                          http://php.indiana.edu/~jsiek/
 Ph.D. Student, Indiana Univ. B'ton   email: jsiek_at_[hidden]
 C++ Booster (http://www.boost.org)   office phone: [phone]
----------------------------------------------------------------------