By the way, I thought there might be an issue w/ my using a rectangle topology for the random_graph_layout and then a square topology for the fructerman_reingold ... so I changed it all to use the rectangle topology, but that didn't fix the problem. New code is below: using namespace boost; // Declare global types enum vertex_position_t { vertex_position }; namespace boost { BOOST_INSTALL_PROPERTY(vertex, position); } //typedef square_topology<>::point_type point; typedef rectangle_topology<>::point_type point; struct simple_edge { int first, second; }; struct spring_attractive_force { template T operator()(typename graph_traits<Graph>::edge_descriptor, T k, T d, const Graph&) const { return d; } }; struct magnetic_repulsive_force { template T operator()(typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, T k, T d, const Graph&) const { return 1 / (d * d); } }; int _tmain(int argc, _TCHAR* argv[]) { typedef adjacency_list >, // Edge properties property > Graph; enum {A, B, C, D, E, F, G, H}; simple_edge triangular_edges[14] = { {A, B}, {B, C}, {C, A}, {D, E}, {E, F}, {F, G}, {G, H}, {H, D}, {D, F}, {F, H}, {H, E}, {E, G}, {G, D} }; Graph g(&triangular_edges[0], &triangular_edges[13], 8); // Generate (x,y) coordinates for every node // - Randomly layout vertices of graph minstd_rand gen; rectangle_topology<> rect_top(gen, -25, -25, 25, 25); random_graph_layout(g, get(vertex_position, g), rect_top); // - Run Fruchterman Reingold algorithm on them //typedef square_topology<> Topology; //Topology topology(gen, 50.0); fruchterman_reingold_force_directed_layout(g, get(vertex_position, g), /* topology */ rect_top, attractive_force(spring_attractive_force()). repulsive_force(magnetic_repulsive_force()). force_pairs(all_force_pairs()). cooling(linear_cooling<double>(100))); } -- View this message in context: http://boost.2283326.n4.nabble.com/Trouble-w-fruchterman-reingold-tp4636494p... Sent from the Boost - Users mailing list archive at Nabble.com.

On Thu, 4 Oct 2012, eric wrote:

I can't explain this, but when I changed the VertexList type parameter on adjacency_list (the second parameter) from listS to veS, it started working beautifully.

Is that a bug, maybe?

When you were using listS as the vertex container, you were creating a vertex_index property but not initializing. Thus, the vertex_index values were most likely all zero, and so all vertices were mapped to the same location in the displacement map. Switching to vecS made the vertex_index property auto-generated with correct values, fixing the bug. -- Jeremiah Willcock

On Thu, 4 Oct 2012, eric wrote:

Wow, okay ... thank you. I have to admit that this is all a little bit of voodoo for me. There are a lot of things going on behind the scenes that I don't understand.

I'm trying to get my toy prototype into what I need it to be, but as soon as I switch from defining my Vertex this way:

typedef property

...

Vertex;

to defining it this way:

struct Vertex { int property1; int property2; };

I start getting this compiler error:

1>c:\program files (x86)\boost\boost_1_51\boost\graph\detail\adjacency_list.hpp(2540) : error C2039: 'type' : is not a member of 'boost::property_value' 1> with 1> [ 1> PropertyList=wmain::Vertex, 1> Tag=int 1> ]

That comes from "struct vec_adj_list_any_vertex_pa", which I assume is the vector adjacency_list vertex property ... accessor? Anyway, I don't know how to get my property_value to have a "::type" ... or where the property_value comes from in the first place, for that matter.

property_value is a traits class that looks up the type information about a property map. I don't know why Tag is set to "int"; it would usually have the name of the property map that is not being found (likely vertex_index_t in your case). That might be elsewhere in the instantiation stack, though.

Could you help me understand? Or if there is something I could read that would clear it all up for me, that would be awesome, too. I trolled through the docs, but haven't hit on something that makes me understand what is going on.

I don't know if there is a good explanation now, but since you changed the definition of Vertex, you are no longer providing a vertex_index_t property map (assuming you are using listS as vertex container), and so you'll need to provide either that or a displacement map to fruchterman_reingold as an explicit argument. See the vertex_index_map part of http://www.boost.org/doc/libs/1_51_0/libs/graph/doc/fruchterman_reingold.htm... for how to pass a custom vertex index map to the algorithm. -- Jeremiah Willcock

I created one like such: property_map positionMap; minstd_rand gen; Topology rect_top(gen, -25, -25, 25, 25); random_graph_layout(patentGraph, positionMap, rect_top); and I get the following errors: 1>c:\program files (x86)\boost\boost_1_51\boost\graph\detail\adjacency_list.hpp(2540) : error C2039: 'type' : is not a member of 'boost::property_value' 1> with 1> [ 1> PropertyList=wmain::Vertex, 1> Tag=boost::rectangle_topology<>::point_type 1> ] 1> c:\program files (x86)\boost\boost_1_51\boost\graph\detail\adjacency_list.hpp(2594) : see reference to class template instantiation 'boost::vec_adj_list_any_vertex_pa::bind_' being compiled 1> with 1> [ 1> Tag=boost::rectangle_topology<>::point_type, 1> Graph=Graph, 1> Property=wmain::Vertex 1> ] I should have mentioned before that I am using vecS now: typedef adjacency_list Graph; -- View this message in context: http://boost.2283326.n4.nabble.com/Trouble-w-fruchterman-reingold-tp4636494p... Sent from the Boost - Users mailing list archive at Nabble.com.

I changed it to: property_map::vertex_descriptor, Topology::point_type> positionMap; minstd_rand gen; Topology rect_top(gen, -25, -25, 25, 25); random_graph_layout(graph, positionMap, rect_top); so that it would conform w/ the description here http://www.boost.org/doc/libs/1_51_0/libs/graph/doc/random_layout.html that says: IN/OUT: PositionMap position The property map that stores the position of each vertex. The type PositionMap must be a model of Lvalue Property Map such that the vertex descriptor type of Graph is convertible to its key type. Its value type must be Topology::point_type, representing the coordinates of the vertex. Now I get the error message: 1>c:\program files (x86)\boost\boost_1_51\boost\graph\properties.hpp(222) : error C2039: 'type' : is not a member of 'boost::vertex_property_type<G>' 1> with 1> [ 1> G=unsigned int 1> ] 1> c:\program files (x86)\boost\boost_1_51\boost\graph\properties.hpp(233) : see reference to class template instantiation 'boost::detail::vertex_property_map' being compiled 1> with 1> [ 1> Graph=unsigned int, 1> PropertyTag=boost::rectangle_topology<>::point_type 1> ] I think what I really need is a comprehensible example. All that I've found in the way of an example is here http://www.boost.org/doc/libs/1_42_0/libs/graph/test/layout_test.cpp . But it contains so much Boost-specific jargony things that it's not really good for a beginner to look at and get the sense of how things work. Do you have any such examples up your sleeve? -- View this message in context: http://boost.2283326.n4.nabble.com/Trouble-w-fruchterman-reingold-tp4636494p... Sent from the Boost - Users mailing list archive at Nabble.com.

Thank you! Between your previous reply (which crossed paths w/ my last post) and this one, I'm finally getting somewhere! I have another question, but it's a little unrelated so I'm going to start another thread. -- View this message in context: http://boost.2283326.n4.nabble.com/Trouble-w-fruchterman-reingold-tp4636494p... Sent from the Boost - Users mailing list archive at Nabble.com.