COIN-OR::LEMON - Graph Library

Custom Query (80 matches)

Filters
 
Or
 
  
 
Columns

Show under each result:


Ticket Summary Owner Type Priority Milestone Component
#59 Port the remaining spanning tree algorithms alpar task critical LEMON 1.4 release core
#168 Port bipartite matching algorithms alpar task critical LEMON 1.4 release core
#227 Command line tool for executing various algorithms alpar enhancement critical LEMON 1.5 release core
#346 Port the remaining shortest path algorithms alpar task critical LEMON 1.5 release core
#365 Cannot include <lemon/adaptors.h> in any of my application source files alpar defect critical core
#32 Storing Arcs instead of OutArcIts in Dfs stack deba enhancement major LEMON 1.4 release core
#33 Benchmarking alpar task major LEMON 1.4 release core
#85 Use eps.h for drawing in graphToEps() alpar task major core
#94 Easy erase in list graphs alpar enhancement major core
#105 Consider using the "ziggurat" method in Random::gauss(). alpar enhancement major core
#152 Using processed map in Dijkstra::processed() kpeter enhancement major core
#178 Port dynamic tree based max flow algs. deba task major core
#189 Add the functionality of ItemSetTraits to the graphs deba enhancement major core
#191 Benchmark questions related to Preflow kpeter enhancement major core
#200 Port sparse SubGraph adaptor from SVN deba task major core
#201 Delaunay triangulation deba enhancement major core
#220 Implement a Dual Network Simplex algorithm alpar enhancement major core
#222 Network Simplex alg. for a simplified problem alpar enhancement major core
#225 Binary graph file format alpar enhancement major LEMON 1.5 release core
#237 Line graph implementations alpar enhancement major core
#238 Min cut iterators in Preflow alpar enhancement major LEMON 1.5 release core
#246 s() and t() as an alias for source() and target() alpar enhancement major LEMON 1.5 release core
#247 DegMap kpeter enhancement major core
#251 More efficient graph copying alpar enhancement major LEMON 1.5 release core
#269 Function type interface for Circulation alpar enhancement major core
#271 Provide output in dimacs-solver alpar enhancement major LEMON 1.5 release core
#284 LGF to EPS converter tool alpar enhancement major tools
#287 Specify argument order for ArgParser alpar enhancement major LEMON 1.4 release core
#297 Graph and map serializer alpar enhancement major LEMON 1.5 release core
#300 Faster building of heaps alpar enhancement major core
#310 Bounding box for Bezier-curves deba enhancement major core
#313 Revise the implementation of PairingHeap and RadixHeap alpar enhancement major core
#318 Document MapIt, ConstMapIt and ItemIt classes of standard maps kpeter enhancement major LEMON 1.4 release documentation
#329 Sort outgoing arcs in the build() function of StaticDigraph alpar enhancement major LEMON 1.5 release core
#344 Cairo based version of graphToEps() alpar enhancement major core
#345 Obtaining and storing the LP solution alpar enhancement major LEMON 1.4 release core
#351 Port the LP utilities deba task major LEMON 1.5 release core
#352 Tolerance in GomoryHu deba enhancement major core
#355 SCIP MipSolver backend alpar enhancement major LEMON 1.4 release core
#357 Guidelines for run/init/start alpar enhancement major documentation
#363 Implementing a planar graph type deba enhancement major LEMON 1.4 release core
#367 Gurobi backend for the LP interface alpar enhancement major core
#370 Edge coloring algorithms alpar enhancement major LEMON 1.4 release core
#373 Compile time assertion alpar enhancement major LEMON 1.5 release core
#374 Functions for weakly connected components alpar enhancement major LEMON 1.4 release core
#377 Smaller version of StaticDigraph alpar enhancement major core
#378 Transitive closure alpar enhancement major core
#379 Find odd cycles alpar enhancement major core
#381 Simplified heaps without priority update alpar enhancement major LEMON 1.4 release core
#384 Adaptor class for complementary graph deba enhancement major LEMON 1.5 release core
#385 QuadHeap instead of BinHeap in Dijkstra alpar enhancement major LEMON 1.5 release core
#394 Add supprt for lp_solve alpar enhancement major LEMON 1.5 release core
#399 Missing getter and streaming operator for Node/Arc id alpar enhancement major LEMON 1.5 release core
#400 MPL LpSolver/MipSolver backend alpar enhancement major LEMON 1.5 release core
#402 Maps don't initialize subseqnetly added graph elements to the map-constructor's initial value. alpar enhancement major LEMON 1.5 release core
#407 Extend random_test.cc deba enhancement major LEMON 1.5 release core
#409 Extend unionfind_test.cc alpar enhancement major LEMON 1.5 release core
#412 Implement Dinitz algorithm for the max flow problem alpar task major core
#413 Implement Young-Tarjan-Orlin algorithm for min mean cycle alpar enhancement major core
#415 Custom cost types in NetworkSimplex alpar enhancement major core
#421 Better DAG test and topological ordering implementation alpar enhancement major LEMON 1.4 release core
#425 API for giving back the state of Random deba enhancement major LEMON 1.5 release core
#426 Expose CBC/CPL original interface in CbcMip and ClpLp alpar enhancement major LEMON 1.4 release core
#427 Create build() routine for StaticDigraph that allows # of arcs to be set explicitly alpar enhancement major LEMON 1.4 release core
#431 Remember the lastly evaluated arcs in Circulation (and in Preflow) alpar enhancement major LEMON 1.4 release core
#451 Functionality to test graph data structure consistency alpar enhancement major LEMON 1.5 release core
#462 Extended run time checking in debug mode alpar enhancement major LEMON 1.4 release core
#466 Extended std::vector<> alpar enhancement major LEMON 1.5 release core
#475 DigraphWriter<> always saves Arc label alpar enhancement major LEMON 1.4 release core
#594 STL syle iterators - phase II. alpar enhancement major LEMON 1.4 release core
#597 VF2 (sub)graph isomoprism algorithm alpar enhancement major LEMON 1.4 release core
#604 Faster MaxMatching implementation deba enhancement major LEMON 1.4 release core
#610 PlanarDrawing::run() is incompatible with the PlanarEmbedding algorithm alpar defect major LEMON 1.4 release core
#611 Planar drawing algorithm requires at least 3 nodes deba defect major LEMON 1.4 release core
#151 Possible improvement in the function-type implementation of BFS/DFS/Dijkstra deba enhancement minor core
#224 Static graph maps deba enhancement minor LEMON 1.5 release core
#235 Push-relabel max flow (Preflow) for undirected graphs alpar enhancement minor core
#338 Infinite capacities in Preflow alpar enhancement minor core
#358 Runtime complexity for every algorithm alpar enhancement minor documentation
#452 time_measure.h uses obsolete headears alpar defect minor LEMON 1.5 release core
Note: See TracQuery for help on using queries.