It looks like you may not be passing your weight map into dijkstra_shortest_paths. If that isn't the problem, what are the exact types the compiler says that you are trying to pass to boost::get? Where is dijkstra_shortest_paths_no_color_map is it failing (which line, and which instantiation stack)?
-- Jeremiah Willcock
Jeremiah, here's a test case http://ge.tt/1CPQxuE/v/0 (the 3 million vertices mesh is the bimba6M.obj). There u will see the configuration number 4. In addition, I define a macro USE_BGL_CSR to using compressed sparse row instead of adjacency list. With adjacency list it works fine, but when using csr it fails to compile with the error I reported previously (by the way, it's the only error the compiler will print out). I don't feel like I'm missing the weight map, as I pass it on the graph construction. Please, if you can help me using csr it wold be nice, it should really accelerate SSSP search.