{1} Active Tickets (135 matches)
Results (101 - 135 of 135)
Ticket | Summary | Component | Version | Milestone | Type | Owner | Status | Modified |
---|---|---|---|---|---|---|---|---|
#220 | Implement a Dual Network Simplex algorithm | core | hg main | enhancement | Alpar Juttner | new | 03/23/09 | |
#218 | Path decomposition subroutine in Preflow. | 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 |
#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 |
#201 | Delaunay triangulation | core | hg main | enhancement | Balazs Dezso | new | 10/12/14 | |
#200 | Port sparse SubGraph adaptor from SVN | core | hg main | task | Balazs Dezso | new | 07/10/19 | |
#191 | Benchmark questions related to Preflow | core | hg main | LEMON 1.5 release | enhancement | Peter Kovacs | new | 11/01/18 |
#189 | Add the functionality of ItemSetTraits to the graphs | core | hg main | enhancement | Balazs Dezso | new | 11/04/09 | |
#183 | Improve doc of Elevator | core | hg main | enhancement | Peter Kovacs | assigned | 03/07/13 | |
#178 | Port dynamic tree based max flow algs. | core | hg main | task | Balazs Dezso | new | 11/05/09 | |
#168 | Port bipartite matching algorithms | core | hg main | LEMON 1.4 release | task | Alpar Juttner | new | 01/26/19 |
#152 | Using processed map in Dijkstra::processed() | core | hg main | enhancement | Peter Kovacs | new | 11/24/08 | |
#151 | Possible improvement in the function-type implementation of BFS/DFS/Dijkstra | core | hg main | enhancement | Balazs Dezso | new | 08/02/09 | |
#146 | Cheap copy of maps (reference counting) PHASE II. | core | LEMON 1.5 release | enhancement | Alpar Juttner | assigned | 07/15/16 | |
#139 | Support short and long style parameters in ArgParser | core | hg main | enhancement | Alpar Juttner | assigned | 11/03/08 | |
#123 | dim2::Point default constructor | core | hg main | enhancement | Peter Kovacs | assigned | 11/04/09 | |
#105 | Consider using the "ziggurat" method in Random::gauss(). | core | hg main | enhancement | Alpar Juttner | new | 11/16/10 | |
#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 | ||
#86 | Virtualmap based graphToEps(). | core | enhancement | Alpar Juttner | assigned | 02/17/10 | ||
#85 | Use eps.h for drawing in graphToEps() | core | hg main | task | Alpar Juttner | new | 11/03/08 | |
#78 | Added functionality to graphToEps(). | core | hg main | enhancement | Alpar Juttner | assigned | 11/21/08 | |
#77 | Added functionality to nodePsTexts() named param. of graphToEps(). | core | hg main | enhancement | Alpar Juttner | assigned | 11/21/08 | |
#76 | New features for graphToEps() | core | hg main | enhancement | Alpar Juttner | assigned | 11/03/08 | |
#73 | Port the remaining miscellaneous tools | core | task | Alpar Juttner | assigned | 10/07/09 | ||
#71 | Port Steiner tree approximation algorithm | core | task | Balazs Dezso | assigned | 11/24/08 | ||
#70 | Port VirtualMaps | core | task | Alpar Juttner | assigned | 11/23/08 | ||
#64 | Port constrained shortest path algorithm | core | task | Alpar Juttner | assigned | 12/15/08 | ||
#63 | Port metaheuristics | core | task | Akos Ladanyi | assigned | 07/03/10 | ||
#59 | Port the remaining spanning tree algorithms | core | LEMON 1.5 release | task | Alpar Juttner | new | 10/26/18 | |
#37 | operator= for RangeMap and SparseMap | core | hg main | enhancement | Peter Kovacs | assigned | 11/04/09 | |
#33 | Benchmarking | core | LEMON 1.4 release | task | Alpar Juttner | new | 08/02/13 | |
#8 | GraphToEps() doesn't show loop egdes | core | hg main | enhancement | Alpar Juttner | assigned | 11/03/08 | |
#6 | VGraph and VMap | core | svn trunk | enhancement | Alpar Juttner | assigned | 11/23/08 | |
#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 |
Note:
See TracReports for help on using and creating reports.