Hi,


I am running into problems using bundled properties and the newly
implemented subgraph for them.


In my experience, it seems they are working correctly with the root
subgraph, but they don't translate correctly to the children. The code
compiles, meaning there is the interface, but I get segfaults at
runtime and I think they are related to that problem, for exemple:


<fixed><color><param>7676,0F0F,5050</param>void</color>
tree_gibbs_sampler(Graph & g,
<color><param>7676,0F0F,5050</param>unsigned</color>
<color><param>7676,0F0F,5050</param>int</color> max_steps,
<color><param>7676,0F0F,5050</param>unsigned</color>
<color><param>7676,0F0F,5050</param>int</color> burnoff)

{

	<color><param>7676,0F0F,5050</param>typedef</color>
<color><param>7676,0F0F,5050</param>typename</color>
graph_traits<<Graph>::vertex_iterator  VertexIterator;

	<color><param>7676,0F0F,5050</param>typedef</color>
<color><param>7676,0F0F,5050</param>typename</color>
graph_traits<<Graph>::adjacency_iterator  AdjacencyIterator;

	<color><param>7676,0F0F,5050</param>typedef</color>
<color><param>7676,0F0F,5050</param>typename</color>
graph_traits<<Graph>::vertex_descriptor  VertexDescriptor;

	<color><param>7676,0F0F,5050</param>typedef</color>
<color><param>7676,0F0F,5050</param>typename</color>
graph_traits<<Graph>::edge_descriptor EdgeDescriptor;

	

	AdjacencyIterator w,w_end;

	VertexIterator v, v_end;

	VertexDescriptor u;

	subgraph <<Graph> subgraph_g;


	copy_graph(g, subgraph_g);

	copy_graph(g, f);

	

	cout <<<< g[<color><param>0000,0000,FFFF</param>0</color>] <<<< endl;

	u = vertex(<color><param>0000,0000,FFFF</param>0</color>,subgraph_g);

	cout <<<< subgraph_g[u] <<<< endl;

	

// here the last two line produce the same numbers...


// here I do something to the root subgraph and produce childrens...


	<color><param>7676,0F0F,5050</param>for</color> ( tie(current_tree,
current_tree_end) = subgraph_g.children(); current_tree !=
current_tree_end; ++current_tree)

	{

		

		<color><param>7676,0F0F,5050</param>for</color> (tie(v,v_end) =
vertices (*current_tree); v!= v_end; ++v)

		{

		

		cout <<<< (*current_tree)[*v] <<<< endl;

		

		}


	}


// The last for loop produces strange results, the bundled properties
(here it is just adress to pointers) are not at all consistent
anymore... (with the ones in the original graph or even root subgraph)


So I think there is a problem with the current implementation.


Jean-Noël Rivasseau</fixed>