Tue, 04 May 2004 16:16:49 +0000Able to read min cost flow, max flow, shortest path, matching testgraphs
jacint [Tue, 04 May 2004 16:16:49 +0000] rev 528
Able to read min cost flow, max flow, shortest path, matching testgraphs

Tue, 04 May 2004 14:54:21 +0000Nem tudom, a hugo-n miert nem megy.
athos [Tue, 04 May 2004 14:54:21 +0000] rev 527
Nem tudom, a hugo-n miert nem megy.

Tue, 04 May 2004 14:06:00 +0000bool forward(Edge), bool backward(Edge)
marci [Tue, 04 May 2004 14:06:00 +0000] rev 526
bool forward(Edge), bool backward(Edge)

Tue, 04 May 2004 12:03:04 +0000misc
marci [Tue, 04 May 2004 12:03:04 +0000] rev 525
misc

Tue, 04 May 2004 12:01:49 +0000An undirected graph template UndirGraph<Graph> can be used.
marci [Tue, 04 May 2004 12:01:49 +0000] rev 524
An undirected graph template UndirGraph<Graph> can be used.

Tue, 04 May 2004 12:00:13 +0000Started.
athos [Tue, 04 May 2004 12:00:13 +0000] rev 523
Started.