deba [Mon, 21 Nov 2005 18:12:11 +0000] rev 1824
Erasing old header
Correcting makefile
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.
deba [Mon, 21 Nov 2005 17:59:27 +0000] rev 1822
Erasing from the Makefile.am too
deba [Mon, 21 Nov 2005 17:58:24 +0000] rev 1821
Erasing old tests
deba [Mon, 21 Nov 2005 17:48:00 +0000] rev 1820
Undir Bipartite Graph/Full and Smart/ without concept, doc and concept
checking
hegyi [Mon, 21 Nov 2005 12:07:05 +0000] rev 1819
Reorganizing.
alpar [Mon, 21 Nov 2005 09:08:16 +0000] rev 1818
UndirEulerIt added
alpar [Fri, 18 Nov 2005 11:17:08 +0000] rev 1817
- Spellcheck (pathes->paths)
alpar [Fri, 18 Nov 2005 11:13:11 +0000] rev 1816
- Spellcheck (pathes->paths)
- todos
alpar [Fri, 18 Nov 2005 11:10:53 +0000] rev 1815
Bugfix
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.
deba [Thu, 17 Nov 2005 10:46:38 +0000] rev 1813
Bug fix
alpar [Thu, 17 Nov 2005 10:16:29 +0000] rev 1812
split(Edge) member function added.
alpar [Thu, 17 Nov 2005 10:14:55 +0000] rev 1811
Several bugfices.
deba [Wed, 16 Nov 2005 18:58:10 +0000] rev 1810
Modified iterators on graph maps
Other iterators for not graph maps
marci [Wed, 16 Nov 2005 14:46:22 +0000] rev 1809
The GRAPH_TYPEDEFS macro is a bug.
alpar [Wed, 16 Nov 2005 13:39:29 +0000] rev 1808
wirteable -> writable
alpar [Wed, 16 Nov 2005 13:26:04 +0000] rev 1807
Empty graph is (strongly) connected.
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.
alpar [Wed, 16 Nov 2005 13:19:05 +0000] rev 1805
Iterable Bool maps can count the number of true and false values.
alpar [Wed, 16 Nov 2005 13:17:02 +0000] rev 1804
(UNDIR)GRAPH_TYPEDEFS also defines some basic graph maps
alpar [Wed, 16 Nov 2005 13:15:33 +0000] rev 1803
Better doc.
deba [Wed, 16 Nov 2005 09:15:41 +0000] rev 1802
Demo for topology
deba [Wed, 16 Nov 2005 09:11:44 +0000] rev 1801
Images for doc
deba [Wed, 16 Nov 2005 09:10:24 +0000] rev 1800
bipartite by szakall
deba [Wed, 16 Nov 2005 09:08:36 +0000] rev 1799
Warning because unused parameters
klao [Wed, 16 Nov 2005 05:01:04 +0000] rev 1798
lp_cplex: getDual compiles; untested
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