core
|
#8 |
Alpar Juttner
|
minor
|
GraphToEps() doesn't show loop egdes
|
enhancement
|
core
|
#77 |
Alpar Juttner
|
minor
|
Added functionality to nodePsTexts() named param. of graphToEps().
|
enhancement
|
core
|
#78 |
Alpar Juttner
|
minor
|
Added functionality to graphToEps().
|
enhancement
|
core
|
#123 |
Peter Kovacs
|
minor
|
dim2::Point default constructor
|
enhancement
|
core
|
#139 |
Alpar Juttner
|
minor
|
Support short and long style parameters in ArgParser
|
enhancement
|
core
|
#151 |
Balazs Dezso
|
minor
|
Possible improvement in the function-type implementation of BFS/DFS/Dijkstra
|
enhancement
|
core
|
#183 |
Peter Kovacs
|
minor
|
Improve doc of Elevator
|
enhancement
|
core
|
#224 |
Balazs Dezso
|
minor
|
Static graph maps
|
enhancement
|
core
|
#235 |
Alpar Juttner
|
minor
|
Push-relabel max flow (Preflow) for undirected graphs
|
enhancement
|
core
|
#338 |
Alpar Juttner
|
minor
|
Infinite capacities in Preflow
|
enhancement
|
documentation
|
#358 |
Alpar Juttner
|
minor
|
Runtime complexity for every algorithm
|
enhancement
|
core
|
#452 |
Alpar Juttner
|
minor
|
time_measure.h uses obsolete headears
|
defect
|
core
|
#618 |
Alpar Juttner
|
minor
|
Constrained time measure
|
enhancement
|
core
|
#620 |
Alpar Juttner
|
minor
|
Infinite loop in Nagamochi-Ibaraki with floating-point capacities
|
defect
|
core
|
#658 |
Alpar Juttner
|
minor
|
CMake Rework
|
enhancement
|
core
|
#3 |
Peter Kovacs
|
major
|
ListGraph should store/update the number of edges and nodes
|
enhancement
|
core
|
#37 |
Peter Kovacs
|
major
|
operator= for RangeMap and SparseMap
|
enhancement
|
core
|
#76 |
Alpar Juttner
|
major
|
New features for graphToEps()
|
enhancement
|
core
|
#85 |
Alpar Juttner
|
major
|
Use eps.h for drawing in graphToEps()
|
task
|
core
|
#98 |
Peter Kovacs
|
major
|
Read-Write LoggerBoolMap
|
enhancement
|
core
|
#105 |
Alpar Juttner
|
major
|
Consider using the "ziggurat" method in Random::gauss().
|
enhancement
|
core
|
#152 |
Peter Kovacs
|
major
|
Using processed map in Dijkstra::processed()
|
enhancement
|
core
|
#178 |
Balazs Dezso
|
major
|
Port dynamic tree based max flow algs.
|
task
|
core
|
#189 |
Balazs Dezso
|
major
|
Add the functionality of ItemSetTraits to the graphs
|
enhancement
|
core
|
#191 |
Peter Kovacs
|
major
|
Benchmark questions related to Preflow
|
enhancement
|
core
|
#200 |
Balazs Dezso
|
major
|
Port sparse SubGraph adaptor from SVN
|
task
|
core
|
#201 |
Balazs Dezso
|
major
|
Delaunay triangulation
|
enhancement
|
core
|
#216 |
Peter Kovacs
|
major
|
Member in Circulation to transform the solution to a basic one
|
enhancement
|
core
|
#217 |
Peter Kovacs
|
major
|
Subroutine in Preflow alg. to make the solution cycle-less
|
enhancement
|
core
|
#218 |
Peter Kovacs
|
major
|
Path decomposition subroutine in Preflow.
|
enhancement
|
core
|
#220 |
Alpar Juttner
|
major
|
Implement a Dual Network Simplex algorithm
|
enhancement
|
core
|
#221 |
Peter Kovacs
|
major
|
Primal Network Simplex algorithm with given starting solution
|
enhancement
|
core
|
#222 |
Alpar Juttner
|
major
|
Network Simplex alg. for a simplified problem
|
enhancement
|
core
|
#225 |
Alpar Juttner
|
major
|
Binary graph file format
|
enhancement
|
core
|
#237 |
Alpar Juttner
|
major
|
Line graph implementations
|
enhancement
|
core
|
#238 |
Alpar Juttner
|
major
|
Min cut iterators in Preflow
|
enhancement
|
core
|
#244 |
Peter Kovacs
|
major
|
Support min. cost max. flow in MCF classes
|
enhancement
|
core
|
#246 |
Alpar Juttner
|
major
|
s() and t() as an alias for source() and target()
|
enhancement
|
core
|
#247 |
Peter Kovacs
|
major
|
DegMap
|
enhancement
|
core
|
#249 |
Peter Kovacs
|
major
|
Bidirectional Bfs and Dijkstra
|
enhancement
|
core
|
#251 |
Alpar Juttner
|
major
|
More efficient graph copying
|
enhancement
|
core
|
#252 |
Peter Kovacs
|
major
|
Smaller iterator classes for some graph structures
|
enhancement
|
core
|
#261 |
Peter Kovacs
|
major
|
Support floating-point data in min-cost flow algorithms
|
enhancement
|
core
|
#269 |
Alpar Juttner
|
major
|
Function type interface for Circulation
|
enhancement
|
core
|
#271 |
Alpar Juttner
|
major
|
Provide output in dimacs-solver
|
enhancement
|
tools
|
#284 |
Alpar Juttner
|
major
|
LGF to EPS converter tool
|
enhancement
|
core
|
#287 |
Alpar Juttner
|
major
|
Specify argument order for ArgParser
|
enhancement
|
core
|
#292 |
Peter Kovacs
|
major
|
Checker functions for min cost flow
|
enhancement
|
core
|
#296 |
Peter Kovacs
|
major
|
Multicommodity flow algorithms
|
task
|
core
|
#297 |
Alpar Juttner
|
major
|
Graph and map serializer
|
enhancement
|
core
|
#300 |
Alpar Juttner
|
major
|
Faster building of heaps
|
enhancement
|
core
|
#310 |
Balazs Dezso
|
major
|
Bounding box for Bezier-curves
|
enhancement
|
core
|
#313 |
Alpar Juttner
|
major
|
Revise the implementation of PairingHeap and RadixHeap
|
enhancement
|
documentation
|
#318 |
Peter Kovacs
|
major
|
Document MapIt, ConstMapIt and ItemIt classes of standard maps
|
enhancement
|
core
|
#328 |
Peter Kovacs
|
major
|
Heuristic MinCostFlow and MinCostMaxFlow
|
enhancement
|
core
|
#329 |
Alpar Juttner
|
major
|
Sort outgoing arcs in the build() function of StaticDigraph
|
enhancement
|
core
|
#343 |
Akos Ladanyi
|
major
|
Support arbitrary precision integers and rationals in LEMON
|
enhancement
|
core
|
#344 |
Alpar Juttner
|
major
|
Cairo based version of graphToEps()
|
enhancement
|
core
|
#345 |
Alpar Juttner
|
major
|
Obtaining and storing the LP solution
|
enhancement
|
core
|
#351 |
Balazs Dezso
|
major
|
Port the LP utilities
|
task
|
core
|
#352 |
Balazs Dezso
|
major
|
Tolerance in GomoryHu
|
enhancement
|
core
|
#355 |
Alpar Juttner
|
major
|
SCIP MipSolver backend
|
enhancement
|
documentation
|
#357 |
Alpar Juttner
|
major
|
Guidelines for run/init/start
|
enhancement
|
core
|
#361 |
Peter Kovacs
|
major
|
Tolerance support in BellmanFord
|
enhancement
|
core
|
#363 |
Balazs Dezso
|
major
|
Implementing a planar graph type
|
enhancement
|
core
|
#367 |
Alpar Juttner
|
major
|
Gurobi backend for the LP interface
|
enhancement
|
core
|
#370 |
Alpar Juttner
|
major
|
Edge coloring algorithms
|
enhancement
|
core
|
#373 |
Alpar Juttner
|
major
|
Compile time assertion
|
enhancement
|
core
|
#374 |
Alpar Juttner
|
major
|
Functions for weakly connected components
|
enhancement
|
core
|
#375 |
Peter Kovacs
|
major
|
Both lower and upper supply bounds in Network simplex
|
enhancement
|
core
|
#376 |
Peter Kovacs
|
major
|
A star (A*) algorithm
|
enhancement
|
core
|
#378 |
Alpar Juttner
|
major
|
Transitive closure
|
enhancement
|
core
|
#379 |
Alpar Juttner
|
major
|
Find odd cycles
|
enhancement
|
core
|
#381 |
Alpar Juttner
|
major
|
Simplified heaps without priority update
|
enhancement
|
core
|
#384 |
Balazs Dezso
|
major
|
Adaptor class for complementary graph
|
enhancement
|
core
|
#385 |
Alpar Juttner
|
major
|
QuadHeap instead of BinHeap in Dijkstra
|
enhancement
|
core
|
#394 |
Alpar Juttner
|
major
|
Add supprt for lp_solve
|
enhancement
|
core
|
#399 |
Alpar Juttner
|
major
|
Missing getter and streaming operator for Node/Arc id
|
enhancement
|
core
|
#400 |
Alpar Juttner
|
major
|
MPL LpSolver/MipSolver backend
|
enhancement
|
core
|
#407 |
Balazs Dezso
|
major
|
Extend random_test.cc
|
enhancement
|
core
|
#409 |
Alpar Juttner
|
major
|
Extend unionfind_test.cc
|
enhancement
|
core
|
#412 |
Alpar Juttner
|
major
|
Implement Dinitz algorithm for the max flow problem
|
task
|
core
|
#413 |
Alpar Juttner
|
major
|
Implement Young-Tarjan-Orlin algorithm for min mean cycle
|
enhancement
|
core
|
#415 |
Alpar Juttner
|
major
|
Custom cost types in NetworkSimplex
|
enhancement
|
core
|
#421 |
Alpar Juttner
|
major
|
Better DAG test and topological ordering implementation
|
enhancement
|
core
|
#425 |
Balazs Dezso
|
major
|
API for giving back the state of Random
|
enhancement
|
core
|
#426 |
Alpar Juttner
|
major
|
Expose CBC/CPL original interface in CbcMip and ClpLp
|
enhancement
|
core
|
#427 |
Alpar Juttner
|
major
|
Create build() routine for StaticDigraph that allows # of arcs to be set explicitly
|
enhancement
|
core
|
#431 |
Alpar Juttner
|
major
|
Remember the lastly evaluated arcs in Circulation (and in Preflow)
|
enhancement
|
core
|
#451 |
Alpar Juttner
|
major
|
Functionality to test graph data structure consistency
|
enhancement
|
core
|
#462 |
Alpar Juttner
|
major
|
Extended run time checking in debug mode
|
enhancement
|
core
|
#466 |
Alpar Juttner
|
major
|
Extended std::vector<>
|
enhancement
|
core
|
#475 |
Alpar Juttner
|
major
|
DigraphWriter<> always saves Arc label
|
enhancement
|
core
|
#594 |
Alpar Juttner
|
major
|
STL syle iterators - phase II.
|
enhancement
|
core
|
#597 |
Alpar Juttner
|
major
|
VF2 (sub)graph isomoprism algorithm
|
enhancement
|
core
|
#616 |
Alpar Juttner
|
major
|
Current version 1.3.1 Incompatible with SoPlex-4.0.0
|
defect
|
core
|
#621 |
Alpar Juttner
|
major
|
Lemon and Boost: call of overloaded ‘ignore_unused_variable_warning(...)’ is ambiguous
|
defect
|
core
|
#622 |
Alpar Juttner
|
major
|
unused variable in elevator.h
|
enhancement
|
core
|
#625 |
Alpar Juttner
|
major
|
lemon preflow algorithm init with flowmap failed because of excess < 0
|
defect
|
(more results for this group on next page)
|