Hi, I'm looking to use graph-tool for some work involving percolation theory. So far it is a clear preference over the alternatives (networkx, etc). BUT, I have just tried to use the max flow algorithms with the following result: File "/usr/lib/python2.7/site-packages/graph_tool/flow/__init__.py", line 238, in push_relabel_max_flow _prop("e", g, residual)) RuntimeError: No static implementation was found for the desired routine. This is a graph_tool bug. :-( Please follow but report instructions at http://graph-tool.skewed.de. What follows is debug information. Graph view: boost::UndirectedAdaptor<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, unsigned long, boost::no_property>, boost::no_property, boost::listS>, boost::keep_all, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::vec_adj_list_vertex_id_map<boost::no_property, unsigned long> >
*
Action: boost::_bi::bind_t<void, get_push_relabel_max_flow, boost::_bi::list7<boost::arg<1>, boost::_bi::value<boost::adj_list_edge_property_map<boost::bidirectional_tag, unsigned long, unsigned long&, unsigned long, boost::property<boost::edge_index_t, unsigned long, boost::no_property>, boost::edge_index_t> >, boost::_bi::value<unsigned long>, boost::_bi::value<unsigned long>, boost::_bi::value<unsigned long>, boost::arg<2>, boost::arg<3> > > Arg 1: boost::checked_vector_property_map<double, boost::adj_list_edge_property_map<boost::bidirectional_tag, unsigned long, unsigned long&, unsigned long, boost::property<boost::edge_index_t, unsigned long, boost::no_property>, boost::edge_index_t> > Arg 2: boost::checked_vector_property_map<double, boost::adj_list_edge_property_map<boost::bidirectional_tag, unsigned long, unsigned long&, unsigned long, boost::property<boost::edge_index_t, unsigned long, boost::no_property>, boost::edge_index_t> > All of the max flow methods return this exception. Is there something wrong with my set-up? Or is this a genuine bug? Max flow is critical to my project and I would prefer not to sacrifice speed and use networkx. Thanks, Jeremy -- View this message in context: http://main-discussion-list-for-the-graph-tool-project.982480.n3.nabble.com/... Sent from the Main discussion list for the graph-tool project mailing list archive at Nabble.com.