| author | Alpar Juttner <alpar@cs.elte.hu> | 
| Sat, 27 Sep 2008 14:11:22 +0200 | |
| changeset 285 | d8dc5acf739b | 
| parent 5 | 233b4094ceae | 
| child 322 | 6dbd5184c6a9 | 
| permissions | -rw-r--r-- | 
| alpar@262 | 1 | 20XX-XX-XX Version 1.0 released | 
| alpar@262 | 2 | |
| alpar@262 | 3 | This is the first stable release of LEMON. Compared to the 0.x | 
| alpar@262 | 4 | release series, it features a considerably smaller but more | 
| alpar@262 | 5 | matured set of tools. The API has also completely revised and | 
| alpar@262 | 6 | changed in several places. | 
| alpar@262 | 7 | |
| alpar@262 | 8 | * The major name changes compared to the 0.x series | 
| alpar@262 | 9 | * Graph -> Digraph, UGraph -> Graph | 
| alpar@262 | 10 | * Edge -> Arc, UEdge -> Edge | 
| alpar@262 | 11 | * source(UEdge)/target(UEdge) -> u(Edge)/v(Edge) | 
| alpar@262 | 12 | * Other improvements | 
| alpar@262 | 13 | * Better documentation | 
| alpar@262 | 14 | * Reviewed and cleaned up codebase | 
| alpar@262 | 15 | * CMake based build system (along with the autotools based one) | 
| alpar@262 | 16 | * Contents of the library (ported from 0.x) | 
| alpar@262 | 17 | * Algorithms | 
| alpar@262 | 18 | * breadth-first search (bfs.h) | 
| alpar@262 | 19 | * depth-first search (dfs.h) | 
| alpar@262 | 20 | * Dijkstra's algorithm (dijkstra.h) | 
| alpar@262 | 21 | * Kruskal's algorithm (kruskal.h) | 
| alpar@262 | 22 | * Data structures | 
| alpar@262 | 23 | * graph data structures (list_graph.h, smart_graph.h) | 
| alpar@262 | 24 | * path data structures (path.h) | 
| alpar@262 | 25 | * binary heap data structure (bin_heap.h) | 
| alpar@262 | 26 | * union-find data structures (unionfind.h) | 
| alpar@262 | 27 | * miscellaneous property maps (maps.h) | 
| alpar@262 | 28 | * two dimensional vector and bounding box (dim2.h) | 
| alpar@262 | 29 | * Concepts | 
| alpar@262 | 30 | * graph structure concepts (concepts/digraph.h, concepts/graph.h, | 
| alpar@262 | 31 | concepts/graph_components.h) | 
| alpar@262 | 32 | * concepts for other structures (concepts/heap.h, concepts/maps.h, | 
| alpar@262 | 33 | concepts/path.h) | 
| alpar@262 | 34 | * Tools | 
| alpar@262 | 35 | * Mersenne twister random number generator (random.h) | 
| alpar@262 | 36 | * tools for measuring cpu and wall clock time (time_measure.h) | 
| alpar@262 | 37 | * tools for counting steps and events (counter.h) | 
| alpar@262 | 38 | * tool for parsing command line arguments (arg_parser.h) | 
| alpar@262 | 39 | * tool for visualizing graphs (graph_to_eps.h) | 
| alpar@262 | 40 | * tools for reading and writing data in LEMON Graph Format | 
| alpar@262 | 41 | (lgf_reader.h, lgf_writer.h) | 
| alpar@262 | 42 | * tools to handle the anomalies of calculations with | 
| alpar@262 | 43 | floating point numbers (tolerance.h) | 
| alpar@262 | 44 | * tools to manage RGB colors (color.h) | 
| alpar@262 | 45 | * Infrastructure | 
| alpar@262 | 46 | * extended assertion handling (assert.h) | 
| alpar@262 | 47 | * exception classes and error handling (error.h) | 
| alpar@262 | 48 | * concept checking (concept_check.h) | 
| alpar@262 | 49 | * commonly used mathematical constants (math.h) |