COIN-OR::LEMON - Graph Library

Custom Query (113 matches)

Filters
 
Or
 
  
 
Columns

Show under each result:


Results (1 - 100 of 113)

1 2

Version: hg main (100 matches)

Ticket Summary Owner Type Priority Component
#452 time_measure.h uses obsolete headears Alpar Juttner defect minor core
#616 Current version 1.3.1 Incompatible with SoPlex-4.0.0 Alpar Juttner defect major core
#620 Infinite loop in Nagamochi-Ibaraki with floating-point capacities Alpar Juttner defect minor core
#621 Lemon and Boost: call of overloaded ‘ignore_unused_variable_warning(...)’ is ambiguous Alpar Juttner defect major core
#625 lemon preflow algorithm init with flowmap failed because of excess < 0 Alpar Juttner defect major core
#3 ListGraph should store/update the number of edges and nodes Peter Kovacs enhancement major core
#8 GraphToEps() doesn't show loop egdes Alpar Juttner enhancement minor core
#37 operator= for RangeMap and SparseMap Peter Kovacs enhancement major core
#76 New features for graphToEps() Alpar Juttner enhancement major core
#77 Added functionality to nodePsTexts() named param. of graphToEps(). Alpar Juttner enhancement minor core
#78 Added functionality to graphToEps(). Alpar Juttner enhancement minor core
#98 Read-Write LoggerBoolMap Peter Kovacs enhancement major core
#105 Consider using the "ziggurat" method in Random::gauss(). Alpar Juttner enhancement major core
#123 dim2::Point default constructor Peter Kovacs enhancement minor core
#139 Support short and long style parameters in ArgParser Alpar Juttner enhancement minor core
#151 Possible improvement in the function-type implementation of BFS/DFS/Dijkstra Balazs Dezso enhancement minor core
#152 Using processed map in Dijkstra::processed() Peter Kovacs enhancement major core
#183 Improve doc of Elevator Peter Kovacs enhancement minor core
#189 Add the functionality of ItemSetTraits to the graphs Balazs Dezso enhancement major core
#191 Benchmark questions related to Preflow Peter Kovacs enhancement major core
#201 Delaunay triangulation Balazs Dezso enhancement major core
#216 Member in Circulation to transform the solution to a basic one Peter Kovacs enhancement major core
#217 Subroutine in Preflow alg. to make the solution cycle-less Peter Kovacs enhancement major core
#218 Path decomposition subroutine in Preflow. Peter Kovacs enhancement major core
#220 Implement a Dual Network Simplex algorithm Alpar Juttner enhancement major core
#221 Primal Network Simplex algorithm with given starting solution Peter Kovacs enhancement major core
#222 Network Simplex alg. for a simplified problem Alpar Juttner enhancement major core
#224 Static graph maps Balazs Dezso enhancement minor core
#225 Binary graph file format Alpar Juttner enhancement major core
#227 Command line tool for executing various algorithms Alpar Juttner enhancement critical core
#235 Push-relabel max flow (Preflow) for undirected graphs Alpar Juttner enhancement minor core
#237 Line graph implementations Alpar Juttner enhancement major core
#238 Min cut iterators in Preflow Alpar Juttner enhancement major core
#244 Support min. cost max. flow in MCF classes Peter Kovacs enhancement major core
#246 s() and t() as an alias for source() and target() Alpar Juttner enhancement major core
#247 DegMap Peter Kovacs enhancement major core
#249 Bidirectional Bfs and Dijkstra Peter Kovacs enhancement major core
#251 More efficient graph copying Alpar Juttner enhancement major core
#252 Smaller iterator classes for some graph structures Peter Kovacs enhancement major core
#261 Support floating-point data in min-cost flow algorithms Peter Kovacs enhancement major core
#269 Function type interface for Circulation Alpar Juttner enhancement major core
#271 Provide output in dimacs-solver Alpar Juttner enhancement major core
#284 LGF to EPS converter tool Alpar Juttner enhancement major tools
#287 Specify argument order for ArgParser Alpar Juttner enhancement major core
#292 Checker functions for min cost flow Peter Kovacs enhancement major core
#297 Graph and map serializer Alpar Juttner enhancement major core
#300 Faster building of heaps Alpar Juttner enhancement major core
#310 Bounding box for Bezier-curves Balazs Dezso enhancement major core
#313 Revise the implementation of PairingHeap and RadixHeap Alpar Juttner enhancement major core
#318 Document MapIt, ConstMapIt and ItemIt classes of standard maps Peter Kovacs enhancement major documentation
#328 Heuristic MinCostFlow and MinCostMaxFlow Peter Kovacs enhancement major core
#329 Sort outgoing arcs in the build() function of StaticDigraph Alpar Juttner enhancement major core
#338 Infinite capacities in Preflow Alpar Juttner enhancement minor core
#343 Support arbitrary precision integers and rationals in LEMON Akos Ladanyi enhancement major core
#344 Cairo based version of graphToEps() Alpar Juttner enhancement major core
#345 Obtaining and storing the LP solution Alpar Juttner enhancement major core
#352 Tolerance in GomoryHu Balazs Dezso enhancement major core
#355 SCIP MipSolver backend Alpar Juttner enhancement major core
#357 Guidelines for run/init/start Alpar Juttner enhancement major documentation
#358 Runtime complexity for every algorithm Alpar Juttner enhancement minor documentation
#361 Tolerance support in BellmanFord Peter Kovacs enhancement major core
#363 Implementing a planar graph type Balazs Dezso enhancement major core
#367 Gurobi backend for the LP interface Alpar Juttner enhancement major core
#370 Edge coloring algorithms Alpar Juttner enhancement major core
#373 Compile time assertion Alpar Juttner enhancement major core
#374 Functions for weakly connected components Alpar Juttner enhancement major core
#375 Both lower and upper supply bounds in Network simplex Peter Kovacs enhancement major core
#376 A star (A*) algorithm Peter Kovacs enhancement major core
#378 Transitive closure Alpar Juttner enhancement major core
#379 Find odd cycles Alpar Juttner enhancement major core
#381 Simplified heaps without priority update Alpar Juttner enhancement major core
#384 Adaptor class for complementary graph Balazs Dezso enhancement major core
#385 QuadHeap instead of BinHeap in Dijkstra Alpar Juttner enhancement major core
#394 Add supprt for lp_solve Alpar Juttner enhancement major core
#399 Missing getter and streaming operator for Node/Arc id Alpar Juttner enhancement major core
#400 MPL LpSolver/MipSolver backend Alpar Juttner enhancement major core
#407 Extend random_test.cc Balazs Dezso enhancement major core
#409 Extend unionfind_test.cc Alpar Juttner enhancement major core
#413 Implement Young-Tarjan-Orlin algorithm for min mean cycle Alpar Juttner enhancement major core
#415 Custom cost types in NetworkSimplex Alpar Juttner enhancement major core
#421 Better DAG test and topological ordering implementation Alpar Juttner enhancement major core
#425 API for giving back the state of Random Balazs Dezso enhancement major core
#426 Expose CBC/CPL original interface in CbcMip and ClpLp Alpar Juttner enhancement major core
#427 Create build() routine for StaticDigraph that allows # of arcs to be set explicitly Alpar Juttner enhancement major core
#431 Remember the lastly evaluated arcs in Circulation (and in Preflow) Alpar Juttner enhancement major core
#451 Functionality to test graph data structure consistency Alpar Juttner enhancement major core
#462 Extended run time checking in debug mode Alpar Juttner enhancement major core
#466 Extended std::vector<> Alpar Juttner enhancement major core
#475 DigraphWriter<> always saves Arc label Alpar Juttner enhancement major core
#594 STL syle iterators - phase II. Alpar Juttner enhancement major core
#597 VF2 (sub)graph isomoprism algorithm Alpar Juttner enhancement major core
#618 Constrained time measure Alpar Juttner enhancement minor core
#622 unused variable in elevator.h Alpar Juttner enhancement major core
#85 Use eps.h for drawing in graphToEps() Alpar Juttner task major core
#168 Port bipartite matching algorithms Alpar Juttner task critical core
#178 Port dynamic tree based max flow algs. Balazs Dezso task major core
#200 Port sparse SubGraph adaptor from SVN Balazs Dezso task major core
#296 Multicommodity flow algorithms Peter Kovacs task major core
#346 Port the remaining shortest path algorithms Alpar Juttner task critical core
#351 Port the LP utilities Balazs Dezso task major core
(more results for this group on next page)
1 2
Note: See TracQuery for help on using queries.