Wed, 04 Feb 2004 14:36:46 +0000ValueType/KeyType is NodeMap/EdgeMap
alpar [Wed, 04 Feb 2004 14:36:46 +0000] rev 61
ValueType/KeyType is NodeMap/EdgeMap

Wed, 04 Feb 2004 12:59:17 +0000.
marci [Wed, 04 Feb 2004 12:59:17 +0000] rev 60
.

Wed, 04 Feb 2004 12:46:33 +0000.
marci [Wed, 04 Feb 2004 12:46:33 +0000] rev 59
.

Wed, 04 Feb 2004 12:45:32 +0000BfsIterator2
marci [Wed, 04 Feb 2004 12:45:32 +0000] rev 58
BfsIterator2

Wed, 04 Feb 2004 12:34:15 +0000To make clear, clean() became clear().
alpar [Wed, 04 Feb 2004 12:34:15 +0000] rev 57
To make clear, clean() became clear().

Wed, 04 Feb 2004 11:55:27 +0000Some correction proposed by Marci.
alpar [Wed, 04 Feb 2004 11:55:27 +0000] rev 56
Some correction proposed by Marci.

Tue, 03 Feb 2004 13:41:46 +0000aNode(), bNode(), head() and tail() added
alpar [Tue, 03 Feb 2004 13:41:46 +0000] rev 55
aNode(), bNode(), head() and tail() added

Tue, 03 Feb 2004 13:29:49 +0000.
alpar [Tue, 03 Feb 2004 13:29:49 +0000] rev 54
.

Tue, 03 Feb 2004 12:42:54 +0000.
alpar [Tue, 03 Feb 2004 12:42:54 +0000] rev 53
.

Tue, 03 Feb 2004 12:41:29 +0000An empty Graph class.
alpar [Tue, 03 Feb 2004 12:41:29 +0000] rev 52
An empty Graph class.

Fri, 30 Jan 2004 15:23:46 +0000atrendezes
marci [Fri, 30 Jan 2004 15:23:46 +0000] rev 51
atrendezes

Fri, 30 Jan 2004 14:56:11 +0000*** empty log message ***
jacint [Fri, 30 Jan 2004 14:56:11 +0000] rev 50
*** empty log message ***

Fri, 30 Jan 2004 14:55:10 +0000marci_graph_demo in new concept
marci [Fri, 30 Jan 2004 14:55:10 +0000] rev 49
marci_graph_demo in new concept

Fri, 30 Jan 2004 14:54:32 +0000marci_graph_demo, iterator_bfs_dfs_demo
marci [Fri, 30 Jan 2004 14:54:32 +0000] rev 48
marci_graph_demo, iterator_bfs_dfs_demo

Fri, 30 Jan 2004 14:53:17 +0000Moved to /jacint
jacint [Fri, 30 Jan 2004 14:53:17 +0000] rev 47
Moved to /jacint

Fri, 30 Jan 2004 14:52:04 +0000marci_list_graph.hh in the new upper-cased concept
marci [Fri, 30 Jan 2004 14:52:04 +0000] rev 46
marci_list_graph.hh in the new upper-cased concept

Fri, 30 Jan 2004 14:51:01 +0000iterator style bfs, dfs
marci [Fri, 30 Jan 2004 14:51:01 +0000] rev 45
iterator style bfs, dfs

Fri, 30 Jan 2004 14:50:10 +0000some informations on the upper-cased new graph concept
marci [Fri, 30 Jan 2004 14:50:10 +0000] rev 44
some informations on the upper-cased new graph concept

Fri, 30 Jan 2004 14:49:04 +0000marci_max_flow.hh in the new concept
marci [Fri, 30 Jan 2004 14:49:04 +0000] rev 43
marci_max_flow.hh in the new concept

Fri, 30 Jan 2004 14:48:06 +0000marci_bfs.hh in the new, upper-case concept, and som further improvements
marci [Fri, 30 Jan 2004 14:48:06 +0000] rev 42
marci_bfs.hh in the new, upper-case concept, and som further improvements

Thu, 29 Jan 2004 17:47:41 +0000bin_heap.hh:
klao [Thu, 29 Jan 2004 17:47:41 +0000] rev 41
bin_heap.hh:
erase metodus
empty szebben :)

Tue, 27 Jan 2004 21:36:17 +0000Jacint conflict-janak kijavitasa
klao [Tue, 27 Jan 2004 21:36:17 +0000] rev 40
Jacint conflict-janak kijavitasa

Tue, 27 Jan 2004 21:23:33 +0000Alap leiras a BinHeap -rol
klao [Tue, 27 Jan 2004 21:23:33 +0000] rev 39
Alap leiras a BinHeap -rol

BinHeap::state() befejezese

Tue, 27 Jan 2004 19:17:46 +0000-MM sajnos mashogy mukodik meg a 3.0 alatt
klao [Tue, 27 Jan 2004 19:17:46 +0000] rev 38
-MM sajnos mashogy mukodik meg a 3.0 alatt
-ansi -pedantic
bin_heap_demo hozzaadva a binarisokhoz

Tue, 27 Jan 2004 19:16:38 +0000Generikus binaris kupac implementacio.
klao [Tue, 27 Jan 2004 19:16:38 +0000] rev 37
Generikus binaris kupac implementacio.
Alap demo file mukodesenek bemutatasahoz.

Tue, 27 Jan 2004 16:23:51 +0000preflow_push.hh: Preflow-push valtozat by athos
athos [Tue, 27 Jan 2004 16:23:51 +0000] rev 36
preflow_push.hh: Preflow-push valtozat by athos
A tesztfile: pf_demo.cc
Kulon makefile is van.

Mon, 26 Jan 2004 11:17:14 +0000.
alpar [Mon, 26 Jan 2004 11:17:14 +0000] rev 35
.

Sun, 25 Jan 2004 18:33:17 +0000Okos makefile
klao [Sun, 25 Jan 2004 18:33:17 +0000] rev 34
Okos makefile
depend szabalyok
egyszeru valami.cc -> valami esetek implicit szabalyokkal

Fri, 23 Jan 2004 22:26:13 +0000Primitive Dijkstra with stl priority queue. flow_test.cc is for testing flows and Dijkstra.
jacint [Fri, 23 Jan 2004 22:26:13 +0000] rev 33
Primitive Dijkstra with stl priority queue. flow_test.cc is for testing flows and Dijkstra.

Fri, 23 Jan 2004 22:22:12 +0000A new version is coming.
jacint [Fri, 23 Jan 2004 22:22:12 +0000] rev 32
A new version is coming.

Thu, 22 Jan 2004 17:04:38 +0000c++
marci [Thu, 22 Jan 2004 17:04:38 +0000] rev 31
c++

Wed, 21 Jan 2004 14:51:05 +0000is_valid changed to valid
jacint [Wed, 21 Jan 2004 14:51:05 +0000] rev 30
is_valid changed to valid

Wed, 21 Jan 2004 08:39:33 +0000.
alpar [Wed, 21 Jan 2004 08:39:33 +0000] rev 29
.

Wed, 21 Jan 2004 08:38:45 +0000@insertcopying is kikommentezve.
alpar [Wed, 21 Jan 2004 08:38:45 +0000] rev 28
@insertcopying is kikommentezve.

Wed, 21 Jan 2004 08:37:17 +0000a @copying-gal baj van -> kikommentezve!
alpar [Wed, 21 Jan 2004 08:37:17 +0000] rev 27
a @copying-gal baj van -> kikommentezve!

Wed, 21 Jan 2004 08:36:30 +0000a @tie nem megy a neumannon
alpar [Wed, 21 Jan 2004 08:36:30 +0000] rev 26
a @tie nem megy a neumannon

Wed, 21 Jan 2004 08:28:57 +0000.
alpar [Wed, 21 Jan 2004 08:28:57 +0000] rev 25
.

Tue, 20 Jan 2004 21:28:29 +0000makefile for the flow algorithms by jacint
jacint [Tue, 20 Jan 2004 21:28:29 +0000] rev 24
makefile for the flow algorithms by jacint

Tue, 20 Jan 2004 21:27:45 +0000Test for the flow algorithms
jacint [Tue, 20 Jan 2004 21:27:45 +0000] rev 23
Test for the flow algorithms

Tue, 20 Jan 2004 21:27:28 +0000A reverse bfs
jacint [Tue, 20 Jan 2004 21:27:28 +0000] rev 22
A reverse bfs

Tue, 20 Jan 2004 21:27:10 +0000A max flow algorithm counting only the max flow value
jacint [Tue, 20 Jan 2004 21:27:10 +0000] rev 21
A max flow algorithm counting only the max flow value

Tue, 20 Jan 2004 21:22:35 +0000A max flow algorithm
jacint [Tue, 20 Jan 2004 21:22:35 +0000] rev 20
A max flow algorithm

Tue, 20 Jan 2004 17:39:13 +0000*** empty log message ***
marci [Tue, 20 Jan 2004 17:39:13 +0000] rev 19
*** empty log message ***

Tue, 20 Jan 2004 11:21:42 +0000A documentation proposal using texinfo.
alpar [Tue, 20 Jan 2004 11:21:42 +0000] rev 18
A documentation proposal using texinfo.

Fri, 16 Jan 2004 11:22:05 +0000make_invalid()
marci [Fri, 16 Jan 2004 11:22:05 +0000] rev 17
make_invalid()

Fri, 16 Jan 2004 11:21:47 +0000*** empty log message ***
marci [Fri, 16 Jan 2004 11:21:47 +0000] rev 16
*** empty log message ***

Fri, 16 Jan 2004 11:20:09 +0000new method for making invalid iterators: make_invalid()
marci [Fri, 16 Jan 2004 11:20:09 +0000] rev 15
new method for making invalid iterators: make_invalid()

Mon, 12 Jan 2004 11:50:52 +0000reimplemented max_flow algorithm class with bfs_iterator1
marci [Mon, 12 Jan 2004 11:50:52 +0000] rev 14
reimplemented max_flow algorithm class with bfs_iterator1

Mon, 12 Jan 2004 11:49:56 +0000b_node bug correction
marci [Mon, 12 Jan 2004 11:49:56 +0000] rev 13
b_node bug correction

Mon, 12 Jan 2004 11:49:16 +0000.
marci [Mon, 12 Jan 2004 11:49:16 +0000] rev 12
.

Mon, 12 Jan 2004 11:48:49 +0000bfs_iterator1
marci [Mon, 12 Jan 2004 11:48:49 +0000] rev 11
bfs_iterator1

Fri, 09 Jan 2004 14:57:01 +0000property vectorokhoz korabban is letezo
marci [Fri, 09 Jan 2004 14:57:01 +0000] rev 10
property vectorokhoz korabban is letezo
fill constructorok dokumentaciojat beraktam a doksiba

Tue, 30 Dec 2003 13:59:08 +0000marci
marci [Tue, 30 Dec 2003 13:59:08 +0000] rev 9
marci

Tue, 16 Dec 2003 18:17:51 +0000-New test: bfsdemo2.cc added
alpar [Tue, 16 Dec 2003 18:17:51 +0000] rev 8
-New test: bfsdemo2.cc added
- Graph class has a NodeMap and an EdgeMap member class
- default_bfs_T uning the above Maps is added
- a (property)map must provide a member function SetG() to attach the map
to a graph

Tue, 16 Dec 2003 17:52:52 +0000.
alpar [Tue, 16 Dec 2003 17:52:52 +0000] rev 7
.

Tue, 16 Dec 2003 16:19:08 +0000!!!Tests!!!
alpar [Tue, 16 Dec 2003 16:19:08 +0000] rev 6
!!!Tests!!!