Mon, 21 Nov 2005 12:07:05 +0000Reorganizing.
hegyi [Mon, 21 Nov 2005 12:07:05 +0000] rev 1819
Reorganizing.

Mon, 21 Nov 2005 09:08:16 +0000UndirEulerIt added
alpar [Mon, 21 Nov 2005 09:08:16 +0000] rev 1818
UndirEulerIt added

Fri, 18 Nov 2005 11:17:08 +0000- Spellcheck (pathes->paths)
alpar [Fri, 18 Nov 2005 11:17:08 +0000] rev 1817
- Spellcheck (pathes->paths)

Fri, 18 Nov 2005 11:13:11 +0000- Spellcheck (pathes->paths)
alpar [Fri, 18 Nov 2005 11:13:11 +0000] rev 1816
- Spellcheck (pathes->paths)
- todos

Fri, 18 Nov 2005 11:10:53 +0000Bugfix
alpar [Fri, 18 Nov 2005 11:10:53 +0000] rev 1815
Bugfix

Thu, 17 Nov 2005 15:34:18 +0000As initial value of a new map expression with ()+-/* operators can be given. These operators work on numbers, or on maps. If maps are given, then the new value for a given graph element will be calculated using the value from the given maps that belong to that graph element.
hegyi [Thu, 17 Nov 2005 15:34:18 +0000] rev 1814
As initial value of a new map expression with ()+-/* operators can be given. These operators work on numbers, or on maps. If maps are given, then the new value for a given graph element will be calculated using the value from the given maps that belong to that graph element.

Thu, 17 Nov 2005 10:46:38 +0000Bug fix
deba [Thu, 17 Nov 2005 10:46:38 +0000] rev 1813
Bug fix

Thu, 17 Nov 2005 10:16:29 +0000split(Edge) member function added.
alpar [Thu, 17 Nov 2005 10:16:29 +0000] rev 1812
split(Edge) member function added.

Thu, 17 Nov 2005 10:14:55 +0000Several bugfices.
alpar [Thu, 17 Nov 2005 10:14:55 +0000] rev 1811
Several bugfices.

Wed, 16 Nov 2005 18:58:10 +0000Modified iterators on graph maps
deba [Wed, 16 Nov 2005 18:58:10 +0000] rev 1810
Modified iterators on graph maps
Other iterators for not graph maps

Wed, 16 Nov 2005 14:46:22 +0000The GRAPH_TYPEDEFS macro is a bug.
marci [Wed, 16 Nov 2005 14:46:22 +0000] rev 1809
The GRAPH_TYPEDEFS macro is a bug.

Wed, 16 Nov 2005 13:39:29 +0000wirteable -> writable
alpar [Wed, 16 Nov 2005 13:39:29 +0000] rev 1808
wirteable -> writable

Wed, 16 Nov 2005 13:26:04 +0000Empty graph is (strongly) connected.
alpar [Wed, 16 Nov 2005 13:26:04 +0000] rev 1807
Empty graph is (strongly) connected.

Wed, 16 Nov 2005 13:21:57 +0000The first parameter of runningTimeTest became const.
alpar [Wed, 16 Nov 2005 13:21:57 +0000] rev 1806
The first parameter of runningTimeTest became const.
It is necessary to enable to pass of temporary objects.

Wed, 16 Nov 2005 13:19:05 +0000Iterable Bool maps can count the number of true and false values.
alpar [Wed, 16 Nov 2005 13:19:05 +0000] rev 1805
Iterable Bool maps can count the number of true and false values.

Wed, 16 Nov 2005 13:17:02 +0000(UNDIR)GRAPH_TYPEDEFS also defines some basic graph maps
alpar [Wed, 16 Nov 2005 13:17:02 +0000] rev 1804
(UNDIR)GRAPH_TYPEDEFS also defines some basic graph maps

Wed, 16 Nov 2005 13:15:33 +0000Better doc.
alpar [Wed, 16 Nov 2005 13:15:33 +0000] rev 1803
Better doc.

Wed, 16 Nov 2005 09:15:41 +0000Demo for topology
deba [Wed, 16 Nov 2005 09:15:41 +0000] rev 1802
Demo for topology

Wed, 16 Nov 2005 09:11:44 +0000Images for doc
deba [Wed, 16 Nov 2005 09:11:44 +0000] rev 1801
Images for doc

Wed, 16 Nov 2005 09:10:24 +0000bipartite by szakall
deba [Wed, 16 Nov 2005 09:10:24 +0000] rev 1800
bipartite by szakall

Wed, 16 Nov 2005 09:08:36 +0000Warning because unused parameters
deba [Wed, 16 Nov 2005 09:08:36 +0000] rev 1799
Warning because unused parameters

Wed, 16 Nov 2005 05:01:04 +0000lp_cplex: getDual compiles; untested
klao [Wed, 16 Nov 2005 05:01:04 +0000] rev 1798
lp_cplex: getDual compiles; untested

Wed, 16 Nov 2005 04:22:49 +0000lp_test.cc:
klao [Wed, 16 Nov 2005 04:22:49 +0000] rev 1797
lp_test.cc:

* bugfix in cplex part: check compiling and running on two different instances

Tue, 15 Nov 2005 20:51:06 +0000lp_skeleton: _getDual "implemented"
klao [Tue, 15 Nov 2005 20:51:06 +0000] rev 1796
lp_skeleton: _getDual "implemented"