id Summary Status Owner Type Priority Milestone 346 Port the remaining shortest path algorithms new Alpar Juttner task critical LEMON 1.5 release 37 operator= for RangeMap and SparseMap assigned Peter Kovacs enhancement major 98 Read-Write LoggerBoolMap assigned Peter Kovacs enhancement major 152 Using processed map in Dijkstra::processed() new Peter Kovacs enhancement major 189 Add the functionality of ItemSetTraits to the graphs new Balazs Dezso enhancement major 191 Benchmark questions related to Preflow new Peter Kovacs enhancement major LEMON 1.5 release 238 Min cut iterators in Preflow new Alpar Juttner enhancement major LEMON 1.5 release 244 Support min. cost max. flow in MCF classes assigned Peter Kovacs enhancement major LEMON 1.5 release 246 s() and t() as an alias for source() and target() new Alpar Juttner enhancement major LEMON 1.5 release 247 DegMap new Peter Kovacs enhancement major 249 Bidirectional Bfs and Dijkstra assigned Peter Kovacs enhancement major 251 More efficient graph copying new Alpar Juttner enhancement major LEMON 1.5 release 252 Smaller iterator classes for some graph structures assigned Peter Kovacs enhancement major LEMON 1.4 release 269 Function type interface for Circulation new Alpar Juttner enhancement major 271 Provide output in dimacs-solver new Alpar Juttner enhancement major LEMON 1.5 release 287 Specify argument order for ArgParser new Alpar Juttner enhancement major LEMON 1.5 release 292 Checker functions for min cost flow assigned Peter Kovacs enhancement major LEMON 1.5 release 296 Multicommodity flow algorithms assigned Peter Kovacs task major 300 Faster building of heaps new Alpar Juttner enhancement major 313 Revise the implementation of PairingHeap and RadixHeap new Alpar Juttner enhancement major 318 Document MapIt, ConstMapIt and ItemIt classes of standard maps new Peter Kovacs enhancement major LEMON 1.4 release 328 Heuristic MinCostFlow and MinCostMaxFlow assigned Peter Kovacs enhancement major LEMON 1.5 release 329 Sort outgoing arcs in the build() function of StaticDigraph new Alpar Juttner enhancement major LEMON 1.5 release 345 Obtaining and storing the LP solution new Alpar Juttner enhancement major LEMON 1.5 release 351 Port the LP utilities new Balazs Dezso task major LEMON 1.5 release 352 Tolerance in GomoryHu new Balazs Dezso enhancement major 361 Tolerance support in BellmanFord assigned Peter Kovacs enhancement major 373 Compile time assertion new Alpar Juttner enhancement major LEMON 1.5 release 374 Functions for weakly connected components new Alpar Juttner enhancement major LEMON 1.4 release 376 A star (A*) algorithm assigned Peter Kovacs enhancement major 378 Transitive closure new Alpar Juttner enhancement major 379 Find odd cycles new Alpar Juttner enhancement major 381 Simplified heaps without priority update new Alpar Juttner enhancement major LEMON 1.5 release 384 Adaptor class for complementary graph new Balazs Dezso enhancement major LEMON 1.5 release 385 QuadHeap instead of BinHeap in Dijkstra new Alpar Juttner enhancement major LEMON 1.5 release 407 Extend random_test.cc new Balazs Dezso enhancement major LEMON 1.5 release 409 Extend unionfind_test.cc new Alpar Juttner enhancement major LEMON 1.5 release 412 Implement Dinitz algorithm for the max flow problem new Alpar Juttner task major 413 Implement Young-Tarjan-Orlin algorithm for min mean cycle new Alpar Juttner enhancement major 415 Custom cost types in NetworkSimplex new Alpar Juttner enhancement major 123 dim2::Point default constructor assigned Peter Kovacs enhancement minor 151 Possible improvement in the function-type implementation of BFS/DFS/Dijkstra new Balazs Dezso enhancement minor 338 Infinite capacities in Preflow new Alpar Juttner enhancement minor