Mon, 21 Feb 2005 14:59:12 +0000A year has passed again.
alpar [Mon, 21 Feb 2005 14:59:12 +0000] rev 1164
A year has passed again.

Mon, 21 Feb 2005 14:17:24 +0000Let's go on!
alpar [Mon, 21 Feb 2005 14:17:24 +0000] rev 1163
Let's go on!

Mon, 21 Feb 2005 10:08:12 +0000New features in v0.3 lemon-0.3
alpar [Mon, 21 Feb 2005 10:08:12 +0000] rev 1162
New features in v0.3

Mon, 21 Feb 2005 10:07:38 +0000Better doc
alpar [Mon, 21 Feb 2005 10:07:38 +0000] rev 1161
Better doc

Mon, 21 Feb 2005 09:28:00 +0000We have UndirGraph, so BidirGraph has been removed.
alpar [Mon, 21 Feb 2005 09:28:00 +0000] rev 1160
We have UndirGraph, so BidirGraph has been removed.

Sun, 20 Feb 2005 01:03:09 +0000svn:ignore change on src/demo
klao [Sun, 20 Feb 2005 01:03:09 +0000] rev 1159
svn:ignore change on src/demo

Sun, 20 Feb 2005 01:02:07 +0000Graph and UndirGraph concept modifications.
klao [Sun, 20 Feb 2005 01:02:07 +0000] rev 1158
Graph and UndirGraph concept modifications.

* For incidence iterators ({In,Out,Inc}EdgeIt) there is now baseNode and
runningNode functions in graph interface
* For Edge in undir graphs: Edge(UndirGraph const &, UndirEdge, Node)
constructor. Same for IncEdgeIt
* Edge(UndirEdge, bool) constructor is no more in the public interface. (But we
need it in the developpers interface).

Sat, 19 Feb 2005 21:11:20 +0000lemon/error.h: boost::shared_ptr helyett std::auto_ptr
klao [Sat, 19 Feb 2005 21:11:20 +0000] rev 1157
lemon/error.h: boost::shared_ptr helyett std::auto_ptr
(Sokkal kenylemetlenebb, es nem teljesen biztos, hogy helyes megoldas)

Fri, 18 Feb 2005 16:40:48 +0000Wrap long lines
alpar [Fri, 18 Feb 2005 16:40:48 +0000] rev 1156
Wrap long lines

Fri, 18 Feb 2005 14:46:04 +0000- Better addSource()
alpar [Fri, 18 Feb 2005 14:46:04 +0000] rev 1155
- Better addSource()
- More docs

Fri, 18 Feb 2005 10:36:13 +0000Description of the LEMON directories.
alpar [Fri, 18 Feb 2005 10:36:13 +0000] rev 1154
Description of the LEMON directories.

Thu, 17 Feb 2005 15:14:13 +0000if you have a nuclear power plant and wanna compute small magic squares, then let's do it
marci [Thu, 17 Feb 2005 15:14:13 +0000] rev 1153
if you have a nuclear power plant and wanna compute small magic squares, then let's do it

Wed, 16 Feb 2005 21:40:16 +0000small changes
marci [Wed, 16 Feb 2005 21:40:16 +0000] rev 1152
small changes

Wed, 16 Feb 2005 16:17:30 +0000Several changes in the docs.
alpar [Wed, 16 Feb 2005 16:17:30 +0000] rev 1151
Several changes in the docs.

Tue, 15 Feb 2005 15:00:31 +0000Minor changes.
alpar [Tue, 15 Feb 2005 15:00:31 +0000] rev 1150
Minor changes.

Tue, 15 Feb 2005 14:59:16 +0000A bit better msg.
alpar [Tue, 15 Feb 2005 14:59:16 +0000] rev 1149
A bit better msg.

Tue, 15 Feb 2005 14:58:32 +0000Test the new dijkstra features.
alpar [Tue, 15 Feb 2005 14:58:32 +0000] rev 1148
Test the new dijkstra features.

Tue, 15 Feb 2005 14:56:54 +0000Make Makefile.am up-to-date (as usual).
alpar [Tue, 15 Feb 2005 14:56:54 +0000] rev 1147
Make Makefile.am up-to-date (as usual).

Tue, 15 Feb 2005 14:54:25 +0000Doc improvements.
alpar [Tue, 15 Feb 2005 14:54:25 +0000] rev 1146
Doc improvements.

Fri, 11 Feb 2005 14:56:40 +0000more docs
ladanyi [Fri, 11 Feb 2005 14:56:40 +0000] rev 1145
more docs

Thu, 10 Feb 2005 18:53:30 +0000trying to add constraints of kind 1 <= x[2]+x[3] <= 4
marci [Thu, 10 Feb 2005 18:53:30 +0000] rev 1144
trying to add constraints of kind 1 <= x[2]+x[3] <= 4

Tue, 08 Feb 2005 17:47:19 +0000The pair of setSomeThing function is getSomeThing.
marci [Tue, 08 Feb 2005 17:47:19 +0000] rev 1143
The pair of setSomeThing function is getSomeThing.

Tue, 08 Feb 2005 11:27:03 +0000more docs
ladanyi [Tue, 08 Feb 2005 11:27:03 +0000] rev 1142
more docs

Mon, 07 Feb 2005 17:35:25 +0000This is not ready yet, but I have to go home...
hegyi [Mon, 07 Feb 2005 17:35:25 +0000] rev 1141
This is not ready yet, but I have to go home...

Mon, 07 Feb 2005 15:40:53 +0000Removing from work.
deba [Mon, 07 Feb 2005 15:40:53 +0000] rev 1140
Removing from work.

Mon, 07 Feb 2005 15:40:34 +0000Changing first to iterators.
deba [Mon, 07 Feb 2005 15:40:34 +0000] rev 1139
Changing first to iterators.

Mon, 07 Feb 2005 12:31:30 +0000Fix wrong reference in the documentation.
alpar [Mon, 07 Feb 2005 12:31:30 +0000] rev 1138
Fix wrong reference in the documentation.

Mon, 07 Feb 2005 11:29:25 +0000IO moved to lemon.
deba [Mon, 07 Feb 2005 11:29:25 +0000] rev 1137
IO moved to lemon.

Mon, 07 Feb 2005 11:28:37 +0000Graph documentation
deba [Mon, 07 Feb 2005 11:28:37 +0000] rev 1136
Graph documentation

Mon, 07 Feb 2005 10:50:05 +0000Removing graph_defines.h
deba [Mon, 07 Feb 2005 10:50:05 +0000] rev 1135
Removing graph_defines.h

Mon, 07 Feb 2005 10:49:44 +0000Documentation
deba [Mon, 07 Feb 2005 10:49:44 +0000] rev 1134
Documentation

Mon, 07 Feb 2005 10:48:14 +0000Documentation
deba [Mon, 07 Feb 2005 10:48:14 +0000] rev 1133
Documentation

Sun, 06 Feb 2005 20:14:30 +0000Revised dijkstra.h with several new features added.
alpar [Sun, 06 Feb 2005 20:14:30 +0000] rev 1132
Revised dijkstra.h with several new features added.

Sun, 06 Feb 2005 20:08:25 +0000The new dijkstra.h comes in the next commit.
alpar [Sun, 06 Feb 2005 20:08:25 +0000] rev 1131
The new dijkstra.h comes in the next commit.

Sun, 06 Feb 2005 20:00:56 +0000- PredNodeMap is a NullMap by default
alpar [Sun, 06 Feb 2005 20:00:56 +0000] rev 1130
- PredNodeMap is a NullMap by default
- Execution with stop condition
- Find shortest path between two nodes

Sun, 06 Feb 2005 15:49:37 +0000error.h added
alpar [Sun, 06 Feb 2005 15:49:37 +0000] rev 1129
error.h added

Sun, 06 Feb 2005 14:44:41 +0000Several important changes:
alpar [Sun, 06 Feb 2005 14:44:41 +0000] rev 1128
Several important changes:
- Named parameters for setting ReachedMap
- run() is separated into initialization and processing phase
- It is possible to run Dijkstra from multiple sources
- It is possible to stop the execution when a destination is reached.

Sun, 06 Feb 2005 14:38:00 +0000Document state_enum
alpar [Sun, 06 Feb 2005 14:38:00 +0000] rev 1127
Document state_enum

Sat, 05 Feb 2005 20:17:15 +0000Oops.
alpar [Sat, 05 Feb 2005 20:17:15 +0000] rev 1126
Oops.

Sat, 05 Feb 2005 20:05:01 +0000A new exception class called UninitializedParameter.
alpar [Sat, 05 Feb 2005 20:05:01 +0000] rev 1125
A new exception class called UninitializedParameter.

Sat, 05 Feb 2005 13:40:01 +0000Dijkstra documentation is getting ready, but one decision is missing about naming conventions about named_params
hegyi [Sat, 05 Feb 2005 13:40:01 +0000] rev 1124
Dijkstra documentation is getting ready, but one decision is missing about naming conventions about named_params

Fri, 04 Feb 2005 15:32:11 +0000Documentation is developing itself, but is not ready yet.
hegyi [Fri, 04 Feb 2005 15:32:11 +0000] rev 1123
Documentation is developing itself, but is not ready yet.

Thu, 03 Feb 2005 19:31:37 +0000New error.h moved to lemon/
klao [Thu, 03 Feb 2005 19:31:37 +0000] rev 1122
New error.h moved to lemon/

Thu, 03 Feb 2005 19:27:10 +0000Obsolete error.h removed
klao [Thu, 03 Feb 2005 19:27:10 +0000] rev 1121
Obsolete error.h removed

Thu, 03 Feb 2005 19:24:42 +0000Latest LEMON exception and assert concepts
klao [Thu, 03 Feb 2005 19:24:42 +0000] rev 1120
Latest LEMON exception and assert concepts

Thu, 03 Feb 2005 16:08:56 +0000Two incomplete additions:
alpar [Thu, 03 Feb 2005 16:08:56 +0000] rev 1119
Two incomplete additions:
- Exceptions
- bool map indication reached nodes (NullMap by default)

Wed, 02 Feb 2005 16:23:41 +0000Minor changes.
alpar [Wed, 02 Feb 2005 16:23:41 +0000] rev 1118
Minor changes.

Wed, 02 Feb 2005 13:11:54 +0000Bugfix
alpar [Wed, 02 Feb 2005 13:11:54 +0000] rev 1117
Bugfix

Wed, 02 Feb 2005 11:54:55 +0000- More or less follows the new naming convetions
alpar [Wed, 02 Feb 2005 11:54:55 +0000] rev 1116
- More or less follows the new naming convetions
- New implementation for dijkstra();

Tue, 01 Feb 2005 15:56:37 +0000Some changes in the IO and map utilities.
deba [Tue, 01 Feb 2005 15:56:37 +0000] rev 1115
Some changes in the IO and map utilities.

Tue, 01 Feb 2005 15:51:22 +0000Tutorial for graph input - output
deba [Tue, 01 Feb 2005 15:51:22 +0000] rev 1114
Tutorial for graph input - output

Tue, 01 Feb 2005 15:43:14 +0000correction
marci [Tue, 01 Feb 2005 15:43:14 +0000] rev 1113
correction

Tue, 01 Feb 2005 15:26:47 +0000try of grouping for documentation
marci [Tue, 01 Feb 2005 15:26:47 +0000] rev 1112
try of grouping for documentation

Tue, 01 Feb 2005 12:53:30 +0000lower and upper bound handling functions for rows
marci [Tue, 01 Feb 2005 12:53:30 +0000] rev 1111
lower and upper bound handling functions for rows

Mon, 31 Jan 2005 17:00:12 +0000new functions for changing lower and upper bounds of variables
marci [Mon, 31 Jan 2005 17:00:12 +0000] rev 1110
new functions for changing lower and upper bounds of variables

Sat, 29 Jan 2005 23:22:56 +0000- Fix missing file (max_matching.h)
alpar [Sat, 29 Jan 2005 23:22:56 +0000] rev 1109
- Fix missing file (max_matching.h)

Sat, 29 Jan 2005 23:22:02 +0000- '%%Title:', '%%Copyright:' and '%%CreationDate:' fields added to graphToEps-
alpar [Sat, 29 Jan 2005 23:22:02 +0000] rev 1108
- '%%Title:', '%%Copyright:' and '%%CreationDate:' fields added to graphToEps-
generated output
- Some more checks in configure.ac

Sat, 29 Jan 2005 15:09:41 +0000- Node shapes are shown in the doc.
alpar [Sat, 29 Jan 2005 15:09:41 +0000] rev 1107
- Node shapes are shown in the doc.
- The generated PS file is closer to be DSC conform.

Fri, 28 Jan 2005 15:37:08 +0000Concept modification to resolve the item by its ID.
deba [Fri, 28 Jan 2005 15:37:08 +0000] rev 1106
Concept modification to resolve the item by its ID.

Fri, 28 Jan 2005 15:19:34 +0000One more trial/approach for named params (Under constr.)
alpar [Fri, 28 Jan 2005 15:19:34 +0000] rev 1105
One more trial/approach for named params (Under constr.)