Mon, 21 Nov 2005 18:03:20 +0000NewMapWin has become Dialog instead of Window. Therefore it is created dynamically, when there is need for it, instead of keeping one instance in memory. This solution is slower, but more correct than before.
hegyi [Mon, 21 Nov 2005 18:03:20 +0000] rev 1823
NewMapWin has become Dialog instead of Window. Therefore it is created dynamically, when there is need for it, instead of keeping one instance in memory. This solution is slower, but more correct than before.

Mon, 21 Nov 2005 17:59:27 +0000Erasing from the Makefile.am too
deba [Mon, 21 Nov 2005 17:59:27 +0000] rev 1822
Erasing from the Makefile.am too

Mon, 21 Nov 2005 17:58:24 +0000Erasing old tests
deba [Mon, 21 Nov 2005 17:58:24 +0000] rev 1821
Erasing old tests

Mon, 21 Nov 2005 17:48:00 +0000Undir Bipartite Graph/Full and Smart/ without concept, doc and concept
deba [Mon, 21 Nov 2005 17:48:00 +0000] rev 1820
Undir Bipartite Graph/Full and Smart/ without concept, doc and concept
checking

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