COIN-OR::LEMON - Graph Library

Custom Query (128 matches)

Filters
 
Or
 
  
 
Columns

Show under each result:


Results (1 - 100 of 128)

1 2
Ticket Summary Status Owner Type Priority Milestone
#146 Cheap copy of maps (reference counting) PHASE II. assigned Alpar Juttner enhancement blocker LEMON 1.5 release
#633 Fixes fox gcc 9 new Alpar Juttner defect blocker LEMON 1.4 release
#59 Port the remaining spanning tree algorithms new Alpar Juttner task critical LEMON 1.5 release
#168 Port bipartite matching algorithms new Alpar Juttner task critical LEMON 1.4 release
#227 Command line tool for executing various algorithms new Alpar Juttner enhancement critical LEMON 1.5 release
#346 Port the remaining shortest path algorithms new Alpar Juttner task critical LEMON 1.5 release
#680 Fix C++17 compilation warnings regarding the use of the deprecated std::iterator. new Alpar Juttner defect critical LEMON 1.4 release
#3 ListGraph should store/update the number of edges and nodes assigned Peter Kovacs enhancement major LEMON 1.4 release
#6 VGraph and VMap assigned Alpar Juttner enhancement major
#33 Benchmarking new Alpar Juttner task major LEMON 1.4 release
#37 operator= for RangeMap and SparseMap assigned Peter Kovacs enhancement major
#63 Port metaheuristics assigned Akos Ladanyi task major
#64 Port constrained shortest path algorithm assigned Alpar Juttner task major
#70 Port VirtualMaps assigned Alpar Juttner task major
#71 Port Steiner tree approximation algorithm assigned Balazs Dezso task major
#73 Port the remaining miscellaneous tools assigned Alpar Juttner task major
#76 New features for graphToEps() assigned Alpar Juttner enhancement major
#85 Use eps.h for drawing in graphToEps() new Alpar Juttner task major
#86 Virtualmap based graphToEps(). assigned Alpar Juttner enhancement major
#94 Easy erase in list graphs new Alpar Juttner enhancement major
#98 Read-Write LoggerBoolMap assigned Peter Kovacs enhancement major
#105 Consider using the "ziggurat" method in Random::gauss(). new Alpar Juttner enhancement major
#152 Using processed map in Dijkstra::processed() new Peter Kovacs enhancement major
#178 Port dynamic tree based max flow algs. new Balazs Dezso task 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
#200 Port sparse SubGraph adaptor from SVN new Balazs Dezso task major
#201 Delaunay triangulation new Balazs Dezso enhancement major
#216 Member in Circulation to transform the solution to a basic one assigned Peter Kovacs enhancement major LEMON 1.5 release
#217 Subroutine in Preflow alg. to make the solution cycle-less assigned Peter Kovacs enhancement major LEMON 1.5 release
#218 Path decomposition subroutine in Preflow. assigned Peter Kovacs enhancement major LEMON 1.5 release
#220 Implement a Dual Network Simplex algorithm new Alpar Juttner enhancement major
#221 Primal Network Simplex algorithm with given starting solution assigned Peter Kovacs enhancement major LEMON 1.5 release
#222 Network Simplex alg. for a simplified problem new Alpar Juttner enhancement major
#225 Binary graph file format new Alpar Juttner enhancement major LEMON 1.5 release
#237 Line graph implementations new Alpar Juttner enhancement major
#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
#261 Support floating-point data in min-cost flow algorithms reopened 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
#284 LGF to EPS converter tool new Alpar Juttner enhancement major
#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
#297 Graph and map serializer new Alpar Juttner enhancement major LEMON 1.5 release
#300 Faster building of heaps new Alpar Juttner enhancement major
#310 Bounding box for Bezier-curves new Balazs Dezso 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
#343 Support arbitrary precision integers and rationals in LEMON assigned Akos Ladanyi enhancement major
#344 Cairo based version of graphToEps() new Alpar Juttner enhancement major
#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
#355 SCIP MipSolver backend new Alpar Juttner enhancement major
#357 Guidelines for run/init/start new Alpar Juttner enhancement major
#361 Tolerance support in BellmanFord assigned Peter Kovacs enhancement major
#363 Implementing a planar graph type new Balazs Dezso enhancement major LEMON 1.5 release
#367 Gurobi backend for the LP interface new Alpar Juttner enhancement major
#370 Edge coloring algorithms new Alpar Juttner enhancement major LEMON 1.5 release
#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
#375 Both lower and upper supply bounds in Network simplex assigned Peter Kovacs enhancement major LEMON 1.5 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
#394 Add supprt for lp_solve new Alpar Juttner enhancement major LEMON 1.5 release
#399 Missing getter and streaming operator for Node/Arc id new Alpar Juttner enhancement major LEMON 1.5 release
#400 MPL LpSolver/MipSolver backend new Alpar Juttner enhancement major LEMON 1.5 release
#402 Maps don't initialize subseqnetly added graph elements to the map-constructor's initial value. 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
#421 Better DAG test and topological ordering implementation new Alpar Juttner enhancement major LEMON 1.4 release
#425 API for giving back the state of Random new Balazs Dezso enhancement major LEMON 1.5 release
#426 Expose CBC/CPL original interface in CbcMip and ClpLp new Alpar Juttner enhancement major LEMON 1.5 release
#427 Create build() routine for StaticDigraph that allows # of arcs to be set explicitly new Alpar Juttner enhancement major LEMON 1.4 release
#431 Remember the lastly evaluated arcs in Circulation (and in Preflow) new Alpar Juttner enhancement major LEMON 1.4 release
#451 Functionality to test graph data structure consistency new Alpar Juttner enhancement major LEMON 1.5 release
#462 Extended run time checking in debug mode new Alpar Juttner enhancement major LEMON 1.4 release
#466 Extended std::vector<> new Alpar Juttner enhancement major LEMON 1.5 release
#475 DigraphWriter<> always saves Arc label new Alpar Juttner enhancement major LEMON 1.5 release
#594 STL syle iterators - phase II. new Alpar Juttner enhancement major LEMON 1.4 release
#597 VF2 (sub)graph isomoprism algorithm reopened Alpar Juttner enhancement major LEMON 1.4 release
#616 Current version 1.3.1 Incompatible with SoPlex-4.0.0 new Alpar Juttner defect major LEMON 1.4 release
#621 Lemon and Boost: call of overloaded ‘ignore_unused_variable_warning(...)’ is ambiguous new Alpar Juttner defect major LEMON 1.4 release
#622 unused variable in elevator.h new Alpar Juttner enhancement major LEMON 1.4 release
1 2
Note: See TracQuery for help on using queries.