{8} Active Tickets, Mine first (135 matches)
Results (1 - 100 of 135)
Active Tickets (100 matches)
Ticket | Summary | Component | Version | Milestone | Type | Owner | Status | Modified |
---|---|---|---|---|---|---|---|---|
#8 | GraphToEps() doesn't show loop egdes | core | hg main | enhancement | Alpar Juttner | assigned | 11/03/08 | |
#139 | Support short and long style parameters in ArgParser | core | hg main | enhancement | Alpar Juttner | assigned | 11/03/08 | |
#76 | New features for graphToEps() | core | hg main | enhancement | Alpar Juttner | assigned | 11/03/08 | |
#85 | Use eps.h for drawing in graphToEps() | core | hg main | task | Alpar Juttner | new | 11/03/08 | |
#77 | Added functionality to nodePsTexts() named param. of graphToEps(). | core | hg main | enhancement | Alpar Juttner | assigned | 11/21/08 | |
#78 | Added functionality to graphToEps(). | core | hg main | enhancement | Alpar Juttner | assigned | 11/21/08 | |
#6 | VGraph and VMap | core | svn trunk | enhancement | Alpar Juttner | assigned | 11/23/08 | |
#70 | Port VirtualMaps | core | task | Alpar Juttner | assigned | 11/23/08 | ||
#152 | Using processed map in Dijkstra::processed() | core | hg main | enhancement | Peter Kovacs | new | 11/24/08 | |
#71 | Port Steiner tree approximation algorithm | core | task | Balazs Dezso | assigned | 11/24/08 | ||
#64 | Port constrained shortest path algorithm | core | task | Alpar Juttner | assigned | 12/15/08 | ||
#235 | Push-relabel max flow (Preflow) for undirected graphs | core | hg main | enhancement | Alpar Juttner | new | 02/25/09 | |
#237 | Line graph implementations | core | hg main | enhancement | Alpar Juttner | new | 03/03/09 | |
#220 | Implement a Dual Network Simplex algorithm | core | hg main | enhancement | Alpar Juttner | new | 03/23/09 | |
#151 | Possible improvement in the function-type implementation of BFS/DFS/Dijkstra | core | hg main | enhancement | Balazs Dezso | new | 08/02/09 | |
#310 | Bounding box for Bezier-curves | core | hg main | enhancement | Balazs Dezso | new | 08/18/09 | |
#313 | Revise the implementation of PairingHeap and RadixHeap | core | hg main | enhancement | Alpar Juttner | new | 09/01/09 | |
#73 | Port the remaining miscellaneous tools | core | task | Alpar Juttner | assigned | 10/07/09 | ||
#98 | Read-Write LoggerBoolMap | core | hg main | enhancement | Peter Kovacs | assigned | 10/12/09 | |
#94 | Easy erase in list graphs | core | enhancement | Alpar Juttner | new | 10/13/09 | ||
#189 | Add the functionality of ItemSetTraits to the graphs | core | hg main | enhancement | Balazs Dezso | new | 11/04/09 | |
#300 | Faster building of heaps | core | hg main | enhancement | Alpar Juttner | new | 11/04/09 | |
#284 | LGF to EPS converter tool | tools | hg main | enhancement | Alpar Juttner | new | 11/04/09 | |
#269 | Function type interface for Circulation | core | hg main | enhancement | Alpar Juttner | new | 11/04/09 | |
#247 | DegMap | core | hg main | enhancement | Peter Kovacs | new | 11/04/09 | |
#37 | operator= for RangeMap and SparseMap | core | hg main | enhancement | Peter Kovacs | assigned | 11/04/09 | |
#123 | dim2::Point default constructor | core | hg main | enhancement | Peter Kovacs | assigned | 11/04/09 | |
#178 | Port dynamic tree based max flow algs. | core | hg main | task | Balazs Dezso | new | 11/05/09 | |
#338 | Infinite capacities in Preflow | core | hg main | enhancement | Alpar Juttner | new | 02/09/10 | |
#86 | Virtualmap based graphToEps(). | core | enhancement | Alpar Juttner | assigned | 02/17/10 | ||
#344 | Cairo based version of graphToEps() | core | hg main | enhancement | Alpar Juttner | new | 02/17/10 | |
#343 | Support arbitrary precision integers and rationals in LEMON | core | hg main | enhancement | Akos Ladanyi | assigned | 02/18/10 | |
#352 | Tolerance in GomoryHu | core | hg main | enhancement | Balazs Dezso | new | 03/02/10 | |
#361 | Tolerance support in BellmanFord | core | hg main | enhancement | Peter Kovacs | assigned | 03/18/10 | |
#367 | Gurobi backend for the LP interface | core | hg main | enhancement | Alpar Juttner | new | 04/16/10 | |
#378 | Transitive closure | core | hg main | enhancement | Alpar Juttner | new | 07/02/10 | |
#379 | Find odd cycles | core | hg main | enhancement | Alpar Juttner | new | 07/02/10 | |
#63 | Port metaheuristics | core | task | Akos Ladanyi | assigned | 07/03/10 | ||
#105 | Consider using the "ziggurat" method in Random::gauss(). | core | hg main | enhancement | Alpar Juttner | new | 11/16/10 | |
#222 | Network Simplex alg. for a simplified problem | core | hg main | enhancement | Alpar Juttner | new | 01/09/11 | |
#358 | Runtime complexity for every algorithm | documentation | hg main | enhancement | Alpar Juttner | new | 01/09/11 | |
#249 | Bidirectional Bfs and Dijkstra | core | hg main | enhancement | Peter Kovacs | assigned | 12/09/11 | |
#376 | A star (A*) algorithm | core | hg main | enhancement | Peter Kovacs | assigned | 12/09/11 | |
#412 | Implement Dinitz algorithm for the max flow problem | core | hg main | task | Alpar Juttner | new | 01/11/12 | |
#413 | Implement Young-Tarjan-Orlin algorithm for min mean cycle | core | hg main | enhancement | Alpar Juttner | new | 01/11/12 | |
#374 | Functions for weakly connected components | core | hg main | LEMON 1.4 release | enhancement | Alpar Juttner | new | 03/02/13 |
#415 | Custom cost types in NetworkSimplex | core | hg main | enhancement | Alpar Juttner | new | 03/07/13 | |
#252 | Smaller iterator classes for some graph structures | core | hg main | LEMON 1.4 release | enhancement | Peter Kovacs | assigned | 03/07/13 |
#318 | Document MapIt, ConstMapIt and ItemIt classes of standard maps | documentation | hg main | LEMON 1.4 release | enhancement | Peter Kovacs | new | 03/07/13 |
#183 | Improve doc of Elevator | core | hg main | enhancement | Peter Kovacs | assigned | 03/07/13 | |
#431 | Remember the lastly evaluated arcs in Circulation (and in Preflow) | core | hg main | LEMON 1.4 release | enhancement | Alpar Juttner | new | 03/09/13 |
#33 | Benchmarking | core | LEMON 1.4 release | task | Alpar Juttner | new | 08/02/13 | |
#3 | ListGraph should store/update the number of edges and nodes | core | hg main | LEMON 1.4 release | enhancement | Peter Kovacs | assigned | 08/02/13 |
#462 | Extended run time checking in debug mode | core | hg main | LEMON 1.4 release | enhancement | Alpar Juttner | new | 10/26/13 |
#201 | Delaunay triangulation | core | hg main | enhancement | Balazs Dezso | new | 10/12/14 | |
#594 | STL syle iterators - phase II. | core | hg main | LEMON 1.4 release | enhancement | Alpar Juttner | new | 10/08/15 |
#146 | Cheap copy of maps (reference counting) PHASE II. | core | LEMON 1.5 release | enhancement | Alpar Juttner | assigned | 07/15/16 | |
#216 | Member in Circulation to transform the solution to a basic one | core | hg main | LEMON 1.5 release | enhancement | Peter Kovacs | assigned | 07/15/16 |
#217 | Subroutine in Preflow alg. to make the solution cycle-less | core | hg main | LEMON 1.5 release | enhancement | Peter Kovacs | assigned | 07/15/16 |
#218 | Path decomposition subroutine in Preflow. | core | hg main | LEMON 1.5 release | enhancement | Peter Kovacs | assigned | 07/15/16 |
#221 | Primal Network Simplex algorithm with given starting solution | core | hg main | LEMON 1.5 release | enhancement | Peter Kovacs | assigned | 07/15/16 |
#224 | Static graph maps | core | hg main | LEMON 1.5 release | enhancement | Balazs Dezso | new | 07/15/16 |
#225 | Binary graph file format | core | hg main | LEMON 1.5 release | enhancement | Alpar Juttner | new | 07/15/16 |
#238 | Min cut iterators in Preflow | core | hg main | LEMON 1.5 release | enhancement | Alpar Juttner | new | 07/15/16 |
#244 | Support min. cost max. flow in MCF classes | core | hg main | LEMON 1.5 release | enhancement | Peter Kovacs | assigned | 07/15/16 |
#246 | s() and t() as an alias for source() and target() | core | hg main | LEMON 1.5 release | enhancement | Alpar Juttner | new | 07/15/16 |
#227 | Command line tool for executing various algorithms | core | hg main | LEMON 1.5 release | enhancement | Alpar Juttner | new | 07/15/16 |
#251 | More efficient graph copying | core | hg main | LEMON 1.5 release | enhancement | Alpar Juttner | new | 07/15/16 |
#271 | Provide output in dimacs-solver | core | hg main | LEMON 1.5 release | enhancement | Alpar Juttner | new | 07/15/16 |
#292 | Checker functions for min cost flow | core | hg main | LEMON 1.5 release | enhancement | Peter Kovacs | assigned | 07/15/16 |
#297 | Graph and map serializer | core | hg main | LEMON 1.5 release | enhancement | Alpar Juttner | new | 07/15/16 |
#328 | Heuristic MinCostFlow and MinCostMaxFlow | core | hg main | LEMON 1.5 release | enhancement | Peter Kovacs | assigned | 07/15/16 |
#329 | Sort outgoing arcs in the build() function of StaticDigraph | core | hg main | LEMON 1.5 release | enhancement | Alpar Juttner | new | 07/15/16 |
#346 | Port the remaining shortest path algorithms | core | hg main | LEMON 1.5 release | task | Alpar Juttner | new | 07/15/16 |
#351 | Port the LP utilities | core | hg main | LEMON 1.5 release | task | Balazs Dezso | new | 07/15/16 |
#373 | Compile time assertion | core | hg main | LEMON 1.5 release | enhancement | Alpar Juttner | new | 07/15/16 |
#384 | Adaptor class for complementary graph | core | hg main | LEMON 1.5 release | enhancement | Balazs Dezso | new | 07/15/16 |
#385 | QuadHeap instead of BinHeap in Dijkstra | core | hg main | LEMON 1.5 release | enhancement | Alpar Juttner | new | 07/15/16 |
#394 | Add supprt for lp_solve | core | hg main | LEMON 1.5 release | enhancement | Alpar Juttner | new | 07/15/16 |
#399 | Missing getter and streaming operator for Node/Arc id | core | hg main | LEMON 1.5 release | enhancement | Alpar Juttner | new | 07/15/16 |
#400 | MPL LpSolver/MipSolver backend | core | hg main | LEMON 1.5 release | enhancement | Alpar Juttner | new | 07/15/16 |
#407 | Extend random_test.cc | core | hg main | LEMON 1.5 release | enhancement | Balazs Dezso | new | 07/15/16 |
#409 | Extend unionfind_test.cc | core | hg main | LEMON 1.5 release | enhancement | Alpar Juttner | new | 07/15/16 |
#425 | API for giving back the state of Random | core | hg main | LEMON 1.5 release | enhancement | Balazs Dezso | new | 07/15/16 |
#451 | Functionality to test graph data structure consistency | core | hg main | LEMON 1.5 release | enhancement | Alpar Juttner | new | 07/15/16 |
#466 | Extended std::vector<> | core | hg main | LEMON 1.5 release | enhancement | Alpar Juttner | new | 07/15/16 |
#357 | Guidelines for run/init/start | documentation | hg main | enhancement | Alpar Juttner | new | 09/12/16 | |
#402 | Maps don't initialize subseqnetly added graph elements to the map-constructor's initial value. | core | release branch 1.2 | LEMON 1.5 release | enhancement | Alpar Juttner | new | 09/12/16 |
#452 | time_measure.h uses obsolete headears | core | hg main | LEMON 1.5 release | defect | Alpar Juttner | new | 09/12/16 |
#261 | Support floating-point data in min-cost flow algorithms | core | hg main | LEMON 1.4 release | enhancement | Peter Kovacs | reopened | 05/25/17 |
#597 | VF2 (sub)graph isomoprism algorithm | core | hg main | LEMON 1.4 release | enhancement | Alpar Juttner | reopened | 10/18/18 |
#427 | Create build() routine for StaticDigraph that allows # of arcs to be set explicitly | core | hg main | LEMON 1.4 release | enhancement | Alpar Juttner | new | 10/23/18 |
#59 | Port the remaining spanning tree algorithms | core | LEMON 1.5 release | task | Alpar Juttner | new | 10/26/18 | |
#381 | Simplified heaps without priority update | core | hg main | LEMON 1.5 release | enhancement | Alpar Juttner | new | 10/26/18 |
#287 | Specify argument order for ArgParser | core | hg main | LEMON 1.5 release | enhancement | Alpar Juttner | new | 10/26/18 |
#345 | Obtaining and storing the LP solution | core | hg main | LEMON 1.5 release | enhancement | Alpar Juttner | new | 10/26/18 |
#426 | Expose CBC/CPL original interface in CbcMip and ClpLp | core | hg main | LEMON 1.5 release | enhancement | Alpar Juttner | new | 10/26/18 |
#475 | DigraphWriter<> always saves Arc label | core | hg main | LEMON 1.5 release | enhancement | Alpar Juttner | new | 10/26/18 |
#370 | Edge coloring algorithms | core | hg main | LEMON 1.5 release | enhancement | Alpar Juttner | new | 10/26/18 |
#375 | Both lower and upper supply bounds in Network simplex | core | hg main | LEMON 1.5 release | enhancement | Peter Kovacs | assigned | 10/26/18 |
Note:
See TracReports for help on using and creating reports.