Boost logo

Boost Users :

From: Gordon Smith (schmoo2k_at_[hidden])
Date: 2004-08-17 14:36:42

I am looking at it now, but if you want to reproduce, the following random
generated graph should cause it also:

 typedef boost::minstd_rand base_generator_type;
 base_generator_type generator;
 generate_random_graph(m_graph, 60, 60, generator);
  edge_iterator e, eend;
  for (tie(e, eend) = edges(m_graph); e != eend; ++e)
   edge_weight[*e] = 1;
circle_graph_layout(m_graph, vertex_pos, 10);
kamada_kawai_spring_layout(m_graph, vertex_pos, edge_weight,


"Doug Gregor" <dgregor_at_[hidden]> wrote in message
> On Aug 17, 2004, at 9:33 AM, Gordon Smith wrote:
> > Just playing with the kamada_kawai_spring_layout , so far for any non
> > trivial graph (more then 4 nodes) - it seems to just go into an
> > infinite
> > loop. The graph is undirected but would contain "circular" paths -
> > thoughts?
> I'm quite sure I botched the default termination condition. You could,
> if you are interested, try writing your own termination condition to
> see the behavior of the "delta" parameter and why my simple
> minimum-finding code doesn't work. Or you could send me one of those
> graphs and I can do the same.
> Doug

Boost-users list run by williamkempf at, kalb at, bjorn.karlsson at, gregod at, wekempf at