Changeset 2265:5bb8867a9351 in lemon0.x
 Timestamp:
 10/27/06 17:08:58 (14 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@3023
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

NEWS
r2075 r2265 1 20061027 Version 0.6 Released 2 3 #New 4 *functor usage for writeable map adaptors 5 *MIP support 6 interface to the cplex MIP solver 7 *data structures 8 ListBpUGraph 9 SmartEdgeset 10 RefPtr: a reference counted pointer class 11 two state variant 12 Polinomial template class 13 SimpleBucketHeap 14 even a smaller version 15 tolerance class 16 Tolerance<unsigned int> and Tolerance<unsigned long long int> added 17 the extender system 18 some UGraphExtender /SubUGraphExtenders, DirectUGraphExtender/ 19 adaptor related 20 ResGraphAdaptor with Tolerance 21 SwapBpUGraphAdaptor which swaps the two nodeset of the bipartite graph 22 map related 23 SimpleMap and SimpleWriteMap 24 new map type based on array map for debugging purpose 25 DynamicAsymMatrixMap 26 MatrixMapTraits 27 *functions 28 optimality test on random graph 29 implementation of the drand48 functions 30 negative cycle to path converter 31 reserveNode function 32 Mersenne Twister random number generator 33 EdgeLookUp and AllEdgeLookUp 34 *scripts 35 script that lists all the header files included directly or indirectly by a certain header file 36 script creates/updates the copyright header of a source file 37 *algorithms 38 algorithm group for matchings 39 Bipartite Graph Max Cardinality Matching (HopcroftKarp) 40 MaxWeightedBipartiteMatching 41 MinCostMaxBipartiteMatching 42 MaxCardinalitySearch 43 MinimalCut in UGraph 44 tabu search 45 Minimum Cost Arborescence algorithm 46 dual solution computation and interface for algorithm 47 EdmondsKarp MaxFlow 48 HaoOrlin algorithm 49 50 #Progress in already existing objects: 51 *radix sort to ansi compatible 52 *map creation based on virtual base class is possible 53 *default constructor which allocates empty graphs 54 *defaultMap is introdouced, graph maps should not be inherited from the ObserverBase. 55 *clarifing alteration observing system 56 *resize for static size graph 57 *an additional simplier interface for static size graphs. 58 *Node operator()(int) for getting node by index 59 *int index(Node node) for getting index by node 60 *traits for alteration notifiers 61 *graph adadptors can be alteration observed 62 *count ANodesBNodes in bipartite graphs 63 *the template assign operators and map iterators can be used for adaptors also 64 *writeable extension of some maps 65 *rot180() added to xy.h 66 *change source and target for the bipartite list graph 67 *findEdge extension also for the BpUGraphs 68 *proper handling of loop edges in the UGraph::findUEdge 69 *exported interface to the Graph class 70 *new random interface 71 *graph imlementations actually provide ReferenceMaps 72 *lgf2ps: 73 RGB color related stuff is in color.h now 74 simple class to create .eps figures (eps.h) 75 "Node shapes" added 76 some color constants added (BLACK, WHITE, RED etc) 77 absolute/relative node size/link width scaling 78 79 #Taken out: 80 *SplitGraph is temporarly deleted 81 *SubBidirGraphAdaptor 82 *obsolote "id" map handling 83 *concepts for extendable and erasable graphs 84 *exceptionName() 85 *bezier.h 86 *functional interfaces 87 *UPath 88 89 #Rewritten, modificated, improved 90 *UnionFindEnum revision 91 *countItems 92 *findEdges 93 *IncEdgeIt goes through on loop edges twice. 94 *mining of the clear in heaps 95 *SplitGraphAdaptor 96 *item sets are written in the order sorted by the labels 97 *make explicit constructors 98 *snapshot 99 rewritten 100 implemented for SmartUGraph an SmartBpUGraph 101 *Node/Edge::operator<() is required by the concept 102 *Graph Component concepts 103 *disabled the copy constructor and operator of {ListSmart}[U]Graph. 104 *modificated interface: colType() functions 105 *made public what() in NodeSetError 106 *improvment in exception handling 107 exception safe erase and clear handler 108 proper exception handling in the SmartEdgeSet 109 rethrow of exception missing 110 *signaling alterations in BpUGraphs 111 *UnionFind 112 takes less space 113 UnionFindEnum 114 changed interface 115 *updated the Path concept 116 *item readers and writers 117 118 #Reorganized: 119 *bootstrap: quiet option 120 *utility, invalid and traits moved to bits 121 *section readers moved to own group 122 *separate group for matrices 123 *single makefile 124 *glemon is moved to own repository 125 *graph_component.h > graph_components.h 126 *reference to modules added 127 *disable assertions in default behaviour 128 *BiVariant moved to lemon/bits/variant.h 129 *using abort() instead of exit(1) 130 131 #Renamed: 132 *Undir > U 133 *Minimum > Min 134 *Work > Aux 135 *UGraphExtender > UndirectGraphExtender 136 UGraphExtenders with changed meaning 137 *GridGraph > GridUGraph 138 *UNDIRGRAPH_TYPEDEFS > UGRAPH_TYPEDEFS 139 *LinearHeap > BucketHeap 140 *UGraphBaseExtender > UndirGraphExtender 141 *BpUGraphBaseExtender merged into BpUGraphExtender 142 *StaticGraph to Graph 143 *ColorSet to Palette 144 *xy > dim2::Point 145 *DirPath to Path 146 *concept > concepts (namespace & directory) 147 148 #Compatibility issues: 149 *compilation with G++ ansi 150 *gcc4.1 151 *NaN checking to be conform to MinGW32 152 *MinGW, MinGW32 153 *long long just for gnu compilers 154 *CPLEX 9.x support 155 *turned off 32bit specific tests. 156 157 #Beyond the aboves several bugfix and documentation improvement is made, new demos, benchmarks are implemented. 158 1 159 20060203 Version 0.5 Released 2 160 * New features:
Note: See TracChangeset
for help on using the changeset viewer.