COIN-OR::LEMON - Graph Library

Custom Query (114 matches)

Filters
 
Or
 
  
 
Columns

Show under each result:


Results (1 - 100 of 114)

1 2
Ticket Summary Status Owner Type Priority Milestone
#365 Cannot include <lemon/adaptors.h> in any of my application source files new alpar defect critical
#452 time_measure.h uses obsolete headears new alpar defect minor LEMON 1.5 release
#3 ListGraph should store/update the number of edges and nodes assigned kpeter enhancement major LEMON 1.4 release
#6 VGraph and VMap assigned alpar enhancement major
#8 GraphToEps() doesn't show loop egdes assigned alpar enhancement minor
#32 Storing Arcs instead of OutArcIts in Dfs stack new deba enhancement major LEMON 1.4 release
#37 operator= for RangeMap and SparseMap assigned kpeter enhancement major
#76 New features for graphToEps() assigned alpar enhancement major
#77 Added functionality to nodePsTexts() named param. of graphToEps(). assigned alpar enhancement minor
#78 Added functionality to graphToEps(). assigned alpar enhancement minor
#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
#123 dim2::Point default constructor assigned kpeter enhancement minor
#139 Support short and long style parameters in ArgParser assigned alpar enhancement minor
#146 Cheap copy of maps (reference counting) PHASE II. assigned alpar enhancement blocker LEMON 1.5 release
#151 Possible improvement in the function-type implementation of BFS/DFS/Dijkstra new deba enhancement minor
#152 Using processed map in Dijkstra::processed() new kpeter enhancement major
#183 Improve doc of Elevator assigned kpeter enhancement minor
#189 Add the functionality of ItemSetTraits to the graphs new deba enhancement major
#191 Benchmark questions related to Preflow new kpeter enhancement major
#201 Delaunay triangulation new deba enhancement major
#216 Member in Circulation to transform the solution to a basic one assigned kpeter enhancement major LEMON 1.5 release
#217 Subroutine in Preflow alg. to make the solution cycle-less assigned kpeter enhancement major LEMON 1.5 release
#218 Path decomposition subroutine in Preflow. assigned kpeter enhancement major LEMON 1.5 release
#220 Implement a Dual Network Simplex algorithm new alpar enhancement major
#221 Primal Network Simplex algorithm with given starting solution assigned kpeter enhancement major LEMON 1.5 release
#222 Network Simplex alg. for a simplified problem new alpar enhancement major
#224 Static graph maps new deba enhancement minor LEMON 1.5 release
#225 Binary graph file format new alpar enhancement major LEMON 1.5 release
#227 Command line tool for executing various algorithms new alpar enhancement critical LEMON 1.5 release
#235 Push-relabel max flow (Preflow) for undirected graphs new alpar enhancement minor
#237 Line graph implementations new alpar enhancement major
#238 Min cut iterators in Preflow new alpar enhancement major LEMON 1.5 release
#244 Support min. cost max. flow in MCF classes assigned kpeter enhancement major LEMON 1.5 release
#246 s() and t() as an alias for source() and target() new alpar enhancement major LEMON 1.5 release
#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 major LEMON 1.4 release
#251 More efficient graph copying new alpar enhancement major LEMON 1.5 release
#252 Smaller iterator classes for some graph structures assigned kpeter enhancement major LEMON 1.4 release
#261 Support floating-point data in min-cost flow algorithms reopened kpeter enhancement major LEMON 1.4 release
#269 Function type interface for Circulation new alpar enhancement major
#271 Provide output in dimacs-solver new alpar enhancement major LEMON 1.5 release
#284 LGF to EPS converter tool new alpar enhancement major
#287 Specify argument order for ArgParser new alpar enhancement major LEMON 1.4 release
#292 Checker functions for min cost flow assigned kpeter enhancement major LEMON 1.5 release
#297 Graph and map serializer new alpar enhancement major LEMON 1.5 release
#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 major LEMON 1.4 release
#328 Heuristic MinCostFlow and MinCostMaxFlow assigned kpeter enhancement major LEMON 1.5 release
#329 Sort outgoing arcs in the build() function of StaticDigraph new alpar enhancement major LEMON 1.5 release
#338 Infinite capacities in Preflow new alpar enhancement minor
#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 major LEMON 1.4 release
#352 Tolerance in GomoryHu new deba enhancement major
#355 SCIP MipSolver backend new alpar enhancement major LEMON 1.4 release
#357 Guidelines for run/init/start new alpar enhancement major
#358 Runtime complexity for every algorithm new alpar enhancement minor
#361 Tolerance support in BellmanFord assigned kpeter enhancement major
#363 Implementing a planar graph type new deba enhancement major LEMON 1.4 release
#367 Gurobi backend for the LP interface new alpar enhancement major
#370 Edge coloring algorithms new alpar enhancement major LEMON 1.4 release
#373 Compile time assertion new alpar enhancement major LEMON 1.5 release
#374 Functions for weakly connected components new alpar enhancement major LEMON 1.4 release
#375 Both lower and upper supply bounds in Network simplex assigned kpeter enhancement major LEMON 1.4 release
#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 major LEMON 1.4 release
#384 Adaptor class for complementary graph new deba enhancement major LEMON 1.5 release
#385 QuadHeap instead of BinHeap in Dijkstra new alpar enhancement major LEMON 1.5 release
#394 Add supprt for lp_solve new alpar enhancement major LEMON 1.5 release
#399 Missing getter and streaming operator for Node/Arc id new alpar enhancement major LEMON 1.5 release
#400 MPL LpSolver/MipSolver backend new alpar enhancement major LEMON 1.5 release
#402 Maps don't initialize subseqnetly added graph elements to the map-constructor's initial value. new alpar enhancement major LEMON 1.5 release
#407 Extend random_test.cc new deba enhancement major LEMON 1.5 release
#409 Extend unionfind_test.cc new alpar enhancement major LEMON 1.5 release
#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 major LEMON 1.4 release
#425 API for giving back the state of Random new deba enhancement major LEMON 1.5 release
#426 Expose CBC/CPL original interface in CbcMip and ClpLp new alpar enhancement major LEMON 1.4 release
#427 Create build() routine for StaticDigraph that allows # of arcs to be set explicitly new alpar enhancement major LEMON 1.4 release
#431 Remember the lastly evaluated arcs in Circulation (and in Preflow) new alpar enhancement major LEMON 1.4 release
#451 Functionality to test graph data structure consistency new alpar enhancement major LEMON 1.5 release
#462 Extended run time checking in debug mode new alpar enhancement major LEMON 1.4 release
#466 Extended std::vector<> new alpar enhancement major LEMON 1.5 release
#475 DigraphWriter<> always saves Arc label new alpar enhancement major LEMON 1.4 release
#594 STL syle iterators - phase II. new alpar enhancement major LEMON 1.4 release
#597 VF2 (sub)graph isomoprism algorithm new alpar enhancement major LEMON 1.4 release
#602 Platform independent pseudo random sequences new alpar enhancement major LEMON 1.4 release
#604 Faster MaxMatching implementation new deba enhancement major LEMON 1.4 release
#33 Benchmarking new alpar task major LEMON 1.4 release
#59 Port the remaining spanning tree algorithms new alpar task critical LEMON 1.4 release
1 2
Note: See TracQuery for help on using queries.