COIN-OR::LEMON - Graph Library

Custom Query (96 matches)

Filters
 
Or
 
  
 
Columns

Show under each result:


Ticket Summary Status Owner Type Milestone Priority
#3 ListGraph should store/update the number of edges and nodes assigned kpeter enhancement LEMON 1.4 release major
#6 VGraph and VMap assigned alpar enhancement major
#32 Storing Arcs instead of OutArcIts in Dfs stack new deba enhancement LEMON 1.4 release major
#33 Benchmarking new alpar task LEMON 1.4 release major
#37 operator= for RangeMap and SparseMap assigned kpeter enhancement major
#63 Port metaheuristics assigned ladanyi task major
#64 Port constrained shortest path algorithm assigned alpar task major
#70 Port VirtualMaps assigned alpar task major
#71 Port Steiner tree approximation algorithm assigned deba task major
#73 Port the remaining miscellaneous tools assigned alpar task major
#76 New features for graphToEps() assigned alpar enhancement major
#85 Use eps.h for drawing in graphToEps() new alpar task major
#86 Virtualmap based graphToEps(). assigned alpar enhancement major
#94 Easy erase in list graphs new alpar enhancement major
#98 Read-Write LoggerBoolMap assigned kpeter enhancement major
#105 Consider using the "ziggurat" method in Random::gauss(). new alpar enhancement major
#145 Support SunCC compiler assigned alpar task major
#152 Using processed map in Dijkstra::processed() new kpeter enhancement major
#178 Port dynamic tree based max flow algs. new deba task major
#189 Add the functionality of ItemSetTraits to the graphs new deba enhancement major
#191 Benchmark questions related to Preflow new kpeter enhancement major
#200 Port sparse SubGraph adaptor from SVN new deba task major
#201 Delaunay triangulation new deba enhancement major
#216 Member in Circulation to transform the solution to a basic one assigned kpeter enhancement LEMON 1.5 release major
#217 Subroutine in Preflow alg. to make the solution cycle-less assigned kpeter enhancement LEMON 1.5 release major
#218 Path decomposition subroutine in Preflow. assigned kpeter enhancement LEMON 1.5 release major
#220 Implement a Dual Network Simplex algorithm new alpar enhancement major
#221 Primal Network Simplex algorithm with given starting solution assigned kpeter enhancement LEMON 1.5 release major
#222 Network Simplex alg. for a simplified problem new alpar enhancement major
#225 Binary graph file format new alpar enhancement LEMON 1.5 release major
#237 Line graph implementations new alpar enhancement major
#238 Min cut iterators in Preflow new alpar enhancement LEMON 1.5 release major
#244 Support min. cost max. flow in MCF classes assigned kpeter enhancement LEMON 1.5 release major
#246 s() and t() as an alias for source() and target() new alpar enhancement LEMON 1.5 release major
#247 DegMap new kpeter enhancement major
#249 Bidirectional Bfs and Dijkstra assigned kpeter enhancement major
#250 Extensions for the interface of paths assigned kpeter enhancement LEMON 1.4 release major
#251 More efficient graph copying new alpar enhancement LEMON 1.5 release major
#252 Smaller iterator classes for some graph structures assigned kpeter enhancement LEMON 1.4 release major
#261 Support floating-point data in min-cost flow algorithms reopened kpeter enhancement LEMON 1.4 release major
#269 Function type interface for Circulation new alpar enhancement major
#271 Provide output in dimacs-solver new alpar enhancement LEMON 1.5 release major
#284 LGF to EPS converter tool new alpar enhancement major
#287 Specify argument order for ArgParser new alpar enhancement LEMON 1.4 release major
#292 Checker functions for min cost flow assigned kpeter enhancement LEMON 1.5 release major
#296 Multicommodity flow algorithms assigned kpeter task major
#297 Graph and map serializer new alpar enhancement LEMON 1.5 release major
#300 Faster building of heaps new alpar enhancement major
#310 Bounding box for Bezier-curves new deba enhancement major
#313 Revise the implementation of PairingHeap and RadixHeap new alpar enhancement major
#318 Document MapIt, ConstMapIt and ItemIt classes of standard maps new kpeter enhancement LEMON 1.4 release major
#328 Heuristic MinCostFlow and MinCostMaxFlow assigned kpeter enhancement LEMON 1.5 release major
#329 Sort outgoing arcs in the build() function of StaticDigraph new alpar enhancement LEMON 1.5 release major
#343 Support arbitrary precision integers and rationals in LEMON assigned ladanyi enhancement major
#344 Cairo based version of graphToEps() new alpar enhancement major
#345 Obtaining and storing the LP solution new alpar enhancement LEMON 1.4 release major
#351 Port the LP utilities new deba task LEMON 1.5 release major
#352 Tolerance in GomoryHu new deba enhancement major
#355 SCIP MipSolver backend new alpar enhancement LEMON 1.4 release major
#357 Guidelines for run/init/start new alpar enhancement major
#361 Tolerance support in BellmanFord assigned kpeter enhancement major
#363 Implementing a planar graph type new deba enhancement LEMON 1.4 release major
#367 Gurobi backend for the LP interface new alpar enhancement major
#370 Edge coloring algorithms new alpar enhancement LEMON 1.4 release major
#373 Compile time assertion new alpar enhancement LEMON 1.5 release major
#374 Functions for weakly connected components new alpar enhancement LEMON 1.4 release major
#375 Both lower and upper supply bounds in Network simplex assigned kpeter enhancement LEMON 1.4 release major
#376 A star (A*) algorithm assigned kpeter enhancement major
#377 Smaller version of StaticDigraph new alpar enhancement major
#378 Transitive closure new alpar enhancement major
#379 Find odd cycles new alpar enhancement major
#381 Simplified heaps without priority update new alpar enhancement LEMON 1.4 release major
#384 Adaptor class for complementary graph new deba enhancement LEMON 1.5 release major
#385 QuadHeap instead of BinHeap in Dijkstra new alpar enhancement LEMON 1.5 release major
#394 Add supprt for lp_solve new alpar enhancement LEMON 1.5 release major
#399 Missing getter and streaming operator for Node/Arc id new alpar enhancement LEMON 1.5 release major
#400 MPL LpSolver/MipSolver backend new alpar enhancement LEMON 1.5 release major
#402 Maps don't initialize subseqnetly added graph elements to the map-constructor's initial value. new alpar enhancement LEMON 1.5 release major
#407 Extend random_test.cc new deba enhancement LEMON 1.5 release major
#409 Extend unionfind_test.cc new alpar enhancement LEMON 1.5 release major
#412 Implement Dinitz algorithm for the max flow problem new alpar task major
#413 Implement Young-Tarjan-Orlin algorithm for min mean cycle new alpar enhancement major
#415 Custom cost types in NetworkSimplex new alpar enhancement major
#421 Better DAG test and topological ordering implementation new alpar enhancement LEMON 1.4 release major
#425 API for giving back the state of Random new deba enhancement LEMON 1.5 release major
#426 Expose CBC/CPL original interface in CbcMip and ClpLp new alpar enhancement LEMON 1.4 release major
#427 Create build() routine for StaticDigraph that allows # of arcs to be set explicitly new alpar enhancement LEMON 1.4 release major
#431 Remember the lastly evaluated arcs in Circulation (and in Preflow) new alpar enhancement LEMON 1.4 release major
#451 Functionality to test graph data structure consistency new alpar enhancement LEMON 1.5 release major
#462 Extended run time checking in debug mode new alpar enhancement LEMON 1.4 release major
#466 Extended std::vector<> new alpar enhancement LEMON 1.5 release major
#475 DigraphWriter<> always saves Arc label new alpar enhancement LEMON 1.4 release major
#594 STL syle iterators - phase II. new alpar enhancement LEMON 1.4 release major
#597 VF2 (sub)graph isomoprism algorithm new alpar enhancement LEMON 1.4 release major
#602 Platform independent pseudo random sequences new alpar enhancement LEMON 1.4 release major
#604 Faster MaxMatching implementation new deba enhancement LEMON 1.4 release major
Note: See TracQuery for help on using queries.