Hello, I have some problems with the max-flow algorithms in the boost graph library. The only algorithm that worked for me was edmund karps, but only when I use long or int values as edge capacities. Here is my graph: typedef adjacency_list<listS, vecS, bidirectionalS, Node, Edge> Graph; typedef graph_traits<Graph> Traits; typedef Traits::vertex_iterator vertex_iter; typedef graph_traits<Graph>::edge_iterator edge_iter; typedef property_map<Graph, default_color_type Node::*>::type ColorMap; typedef property_map<Graph, int Edge::*>::type CapacityMap; typedef property_map<Graph, Graph::edge_descriptor Edge::*>::type ReverseEdgeMap; typedef property_map<Graph, Graph::edge_descriptor Node::*>::type PredecessorMap; typedef property_map<Graph, CapacityMap::value_type Node::*>::type DistanceMap; typedef property_map<Graph, long Node::*>::type IndexMap; struct Edge { CapacityMap::value_type capacity; CapacityMap::value_type residual_capacity; Graph::edge_descriptor reverse; }; struct Node { Mesh::FaceHandle faceHandle; CapacityMap::value_type distance; long index; Traits::edge_descriptor predecessor; boost::default_color_type color; }; Before calling edmund karps I add an edge with zero capacity to each existing edge and set the reverse edges. It would be very nice if anyone could give me a hint why this does not work. The push relabel and the kolmogorov algorithm always return 0 as result :( Best Regards, Matthias -- View this message in context: http://www.nabble.com/-BGL--Edmund-Karps-works-with-long%2C-but-does-not-wit... Sent from the Boost - Users mailing list archive at Nabble.com.