| Mon, 28 Nov 2005 11:14:59 +0000 |
deba |
Doc fix
|
changeset |
files
|
| Mon, 28 Nov 2005 11:14:01 +0000 |
deba |
Radix sort algorithm
|
changeset |
files
|
| Thu, 24 Nov 2005 15:48:53 +0000 |
deba |
Bug fix
|
changeset |
files
|
| Wed, 23 Nov 2005 16:24:59 +0000 |
hegyi |
No segmentation fault caused by zero long edges.
|
changeset |
files
|
| Wed, 23 Nov 2005 16:08:02 +0000 |
deba |
Document improvments
|
changeset |
files
|
| Wed, 23 Nov 2005 15:42:36 +0000 |
deba |
Correcting alteration notifing
|
changeset |
files
|
| Wed, 23 Nov 2005 11:20:14 +0000 |
deba |
Static maps for bipartite graphs.
|
changeset |
files
|
| Tue, 22 Nov 2005 15:15:31 +0000 |
deba |
Fixing bug in g++-3.3
|
changeset |
files
|
| Tue, 22 Nov 2005 14:35:33 +0000 |
ladanyi |
clean-up
|
changeset |
files
|
| Tue, 22 Nov 2005 10:27:25 +0000 |
ladanyi |
fixed some memory leaks
|
changeset |
files
|
| Mon, 21 Nov 2005 18:12:11 +0000 |
deba |
Erasing old header
|
changeset |
files
|
| Mon, 21 Nov 2005 18:03:20 +0000 |
hegyi |
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.
|
changeset |
files
|
| Mon, 21 Nov 2005 17:59:27 +0000 |
deba |
Erasing from the Makefile.am too
|
changeset |
files
|
| Mon, 21 Nov 2005 17:58:24 +0000 |
deba |
Erasing old tests
|
changeset |
files
|
| Mon, 21 Nov 2005 17:48:00 +0000 |
deba |
Undir Bipartite Graph/Full and Smart/ without concept, doc and concept
|
changeset |
files
|
| Mon, 21 Nov 2005 12:07:05 +0000 |
hegyi |
Reorganizing.
|
changeset |
files
|
| Mon, 21 Nov 2005 09:08:16 +0000 |
alpar |
UndirEulerIt added
|
changeset |
files
|
| Fri, 18 Nov 2005 11:17:08 +0000 |
alpar |
- Spellcheck (pathes->paths)
|
changeset |
files
|
| Fri, 18 Nov 2005 11:13:11 +0000 |
alpar |
- Spellcheck (pathes->paths)
|
changeset |
files
|
| Fri, 18 Nov 2005 11:10:53 +0000 |
alpar |
Bugfix
|
changeset |
files
|
| Thu, 17 Nov 2005 15:34:18 +0000 |
hegyi |
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.
|
changeset |
files
|
| Thu, 17 Nov 2005 10:46:38 +0000 |
deba |
Bug fix
|
changeset |
files
|
| Thu, 17 Nov 2005 10:16:29 +0000 |
alpar |
split(Edge) member function added.
|
changeset |
files
|
| Thu, 17 Nov 2005 10:14:55 +0000 |
alpar |
Several bugfices.
|
changeset |
files
|
| Wed, 16 Nov 2005 18:58:10 +0000 |
deba |
Modified iterators on graph maps
|
changeset |
files
|
| Wed, 16 Nov 2005 14:46:22 +0000 |
marci |
The GRAPH_TYPEDEFS macro is a bug.
|
changeset |
files
|
| Wed, 16 Nov 2005 13:39:29 +0000 |
alpar |
wirteable -> writable
|
changeset |
files
|
| Wed, 16 Nov 2005 13:26:04 +0000 |
alpar |
Empty graph is (strongly) connected.
|
changeset |
files
|
| Wed, 16 Nov 2005 13:21:57 +0000 |
alpar |
The first parameter of runningTimeTest became const.
|
changeset |
files
|
| Wed, 16 Nov 2005 13:19:05 +0000 |
alpar |
Iterable Bool maps can count the number of true and false values.
|
changeset |
files
|
| Wed, 16 Nov 2005 13:17:02 +0000 |
alpar |
(UNDIR)GRAPH_TYPEDEFS also defines some basic graph maps
|
changeset |
files
|
| Wed, 16 Nov 2005 13:15:33 +0000 |
alpar |
Better doc.
|
changeset |
files
|