COIN-OR::LEMON - Graph Library

Custom Query (96 matches)

Filters
 
Or
 
  
 
Columns

Show under each result:


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