tags:

views:

4

answers:

0
Q: 

PBGL Compile error on windows.

I am trying to build the PBGL’s boost_graph_mpi on windows 7 64bit.

I generated the project files for VS 8/9/10, however the build has consistently shown compile errors:

distributed_property_map.hpp(240): error C3855: 'boost::parallel::detail::associative_cache_ghost_cell_storage': template parameter 'Associativity' is incompatible with the declaration

I tried to look for hints anywhere on the web, but did not find anything. Can anybody advise. Thanks.

related questions

How to access the ancestor vertex during a breadth-first search with the Boost Graph Library?
BGL concurrent read accesses problem
Using bundled properties as the weight map in dijkstra_shortest_paths
Algorithm for the Planarization of a non-planar Graph
remove_vertex when the graph VertexList=vecS
Perform connected_components with Boost adjacency_list where VertexList=listS
How to fit a custom graph to the boost graph library template?
Boost graph libraries: setting edge weight values
Performance issue with graph incremental construction
Using Boost Graph to search through a DAG Graph?
Modifying bundled properties from visitor
Use a Graph Library/Node Network Library or Write My Own?
[Boost BGL] reducing memory requirements for adjacency list
Boost Graph Library and Visitors
How to make reverse_graph adaptor from my custom Graph type
To find the directed path between two nodes in Partial directed graph using BOOST Graph libraries.
How should I link a data Class to my GUI code (to display attributes of object, in C++)?
Change Target of Edge in BGL
Hierarchical Image Clustering using Boost Graph Library
Boost (BGL): How do dis-obfuscate my errors?
How to use a BGL directed graph as an undirected one (for use in layout algorithm) ?
Using Boost's graph breadth_first_search() to find a path in an unweighted, undirected graph
Boost Graph Library: Is there a neat algorithm built into BGL for community detection?
How to create a C++ Boost undirected graph and traverse it in depth first search (DFS) order?