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"

Tue, 15 Nov 2005 20:50:21 +0000bugfix in undir_graph_extender -> graph_extender transition
klao [Tue, 15 Nov 2005 20:50:21 +0000] rev 1795
bugfix in undir_graph_extender -> graph_extender transition

Mon, 14 Nov 2005 18:55:19 +0000String->Double
deba [Mon, 14 Nov 2005 18:55:19 +0000] rev 1794
String->Double

Mon, 14 Nov 2005 18:40:15 +0000Documentation fixes
deba [Mon, 14 Nov 2005 18:40:15 +0000] rev 1793
Documentation fixes

Mon, 14 Nov 2005 18:39:17 +0000Arrangement of the documentation changed
deba [Mon, 14 Nov 2005 18:39:17 +0000] rev 1792
Arrangement of the documentation changed

Mon, 14 Nov 2005 18:38:41 +0000Modification on the base graph concept
deba [Mon, 14 Nov 2005 18:38:41 +0000] rev 1791
Modification on the base graph concept
The extended interface does not changed

Mon, 14 Nov 2005 18:36:45 +0000Bug fix
deba [Mon, 14 Nov 2005 18:36:45 +0000] rev 1790
Bug fix

Mon, 14 Nov 2005 18:35:20 +0000eps images
deba [Mon, 14 Nov 2005 18:35:20 +0000] rev 1789
eps images

Mon, 14 Nov 2005 18:34:16 +0000Some documentation modifications
deba [Mon, 14 Nov 2005 18:34:16 +0000] rev 1788
Some documentation modifications

Sun, 13 Nov 2005 20:01:17 +0000bugfix in setCol, getting dual values
marci [Sun, 13 Nov 2005 20:01:17 +0000] rev 1787
bugfix in setCol, getting dual values

Thu, 10 Nov 2005 12:41:33 +0000Doc bug fix
deba [Thu, 10 Nov 2005 12:41:33 +0000] rev 1786
Doc bug fix

Thu, 10 Nov 2005 12:40:58 +0000Assertion with own exception throwing
deba [Thu, 10 Nov 2005 12:40:58 +0000] rev 1785
Assertion with own exception throwing

Thu, 10 Nov 2005 12:40:26 +0000Bug fix
deba [Thu, 10 Nov 2005 12:40:26 +0000] rev 1784
Bug fix

Wed, 09 Nov 2005 13:04:39 +0000One more bug fix
deba [Wed, 09 Nov 2005 13:04:39 +0000] rev 1783
One more bug fix

Wed, 09 Nov 2005 12:54:59 +0000Bug fix.
deba [Wed, 09 Nov 2005 12:54:59 +0000] rev 1782
Bug fix.

Wed, 09 Nov 2005 12:07:00 +0000Path length limit for belmann_ford.h
deba [Wed, 09 Nov 2005 12:07:00 +0000] rev 1781
Path length limit for belmann_ford.h

Tue, 08 Nov 2005 10:12:45 +0000- Timer can be stop()ed and (re)start()ed.
alpar [Tue, 08 Nov 2005 10:12:45 +0000] rev 1780
- Timer can be stop()ed and (re)start()ed.
- Obsolete \bug removed

Tue, 08 Nov 2005 10:10:09 +0000Obsolete bug removed
alpar [Tue, 08 Nov 2005 10:10:09 +0000] rev 1779
Obsolete bug removed

Fri, 04 Nov 2005 19:19:52 +0000Some just writeable bool maps.
deba [Fri, 04 Nov 2005 19:19:52 +0000] rev 1778
Some just writeable bool maps.

Fri, 04 Nov 2005 19:07:15 +0000improved zooming
ladanyi [Fri, 04 Nov 2005 19:07:15 +0000] rev 1777
improved zooming

Fri, 04 Nov 2005 17:44:13 +0000Images for grid_graph_demo
deba [Fri, 04 Nov 2005 17:44:13 +0000] rev 1776
Images for grid_graph_demo

Fri, 04 Nov 2005 17:33:33 +0000Added doc to demos.
deba [Fri, 04 Nov 2005 17:33:33 +0000] rev 1775
Added doc to demos.

Fri, 04 Nov 2005 16:40:54 +0000UnsupportedException on erase with Snapshot
deba [Fri, 04 Nov 2005 16:40:54 +0000] rev 1774
UnsupportedException on erase with Snapshot

Fri, 04 Nov 2005 16:35:18 +0000Bugfix
alpar [Fri, 04 Nov 2005 16:35:18 +0000] rev 1773
Bugfix

Fri, 04 Nov 2005 16:35:06 +0000SnapShot -> Snapshot
alpar [Fri, 04 Nov 2005 16:35:06 +0000] rev 1772
SnapShot -> Snapshot

Fri, 04 Nov 2005 16:21:41 +0000(Dual)Expr::simplify(double tolerance) added
alpar [Fri, 04 Nov 2005 16:21:41 +0000] rev 1771
(Dual)Expr::simplify(double tolerance) added

Fri, 04 Nov 2005 16:18:51 +0000SnapShot -> Snapshot
alpar [Fri, 04 Nov 2005 16:18:51 +0000] rev 1770
SnapShot -> Snapshot

Fri, 04 Nov 2005 16:10:23 +0000Removed todo
deba [Fri, 04 Nov 2005 16:10:23 +0000] rev 1769
Removed todo
Moved to topology module

Fri, 04 Nov 2005 15:59:21 +0000Removing findEdge
deba [Fri, 04 Nov 2005 15:59:21 +0000] rev 1768
Removing findEdge

Fri, 04 Nov 2005 15:52:24 +0000Changed name
deba [Fri, 04 Nov 2005 15:52:24 +0000] rev 1767
Changed name

Fri, 04 Nov 2005 15:48:06 +0000Tons of todos have been removed.
alpar [Fri, 04 Nov 2005 15:48:06 +0000] rev 1766
Tons of todos have been removed.

Fri, 04 Nov 2005 15:00:19 +0000Removing todos
deba [Fri, 04 Nov 2005 15:00:19 +0000] rev 1765
Removing todos

Fri, 04 Nov 2005 14:49:14 +0000Images for topology
deba [Fri, 04 Nov 2005 14:49:14 +0000] rev 1764
Images for topology

Fri, 04 Nov 2005 14:48:10 +0000pred => predEdge rename
deba [Fri, 04 Nov 2005 14:48:10 +0000] rev 1763
pred => predEdge rename

Fri, 04 Nov 2005 13:53:22 +0000throwing an exception if s=t
jacint [Fri, 04 Nov 2005 13:53:22 +0000] rev 1762
throwing an exception if s=t

Fri, 04 Nov 2005 13:20:24 +0000Hiding :) todos
deba [Fri, 04 Nov 2005 13:20:24 +0000] rev 1761
Hiding :) todos

Fri, 04 Nov 2005 12:01:40 +0000concept/graph.h: graphs defined by using components (_*Graph) need no
klao [Fri, 04 Nov 2005 12:01:40 +0000] rev 1760
concept/graph.h: graphs defined by using components (_*Graph) need no
documentation