marci [Mon, 03 May 2004 11:43:27 +0000] rev 512
bip matching...
athos [Mon, 03 May 2004 10:27:20 +0000] rev 511
getPath() function implemented.
marci [Mon, 03 May 2004 10:04:27 +0000] rev 510
matching, flows
alpar [Mon, 03 May 2004 09:44:00 +0000] rev 509
(none)
alpar [Mon, 03 May 2004 09:43:03 +0000] rev 508
docfix.
alpar [Mon, 03 May 2004 09:38:17 +0000] rev 507
A "related pages" about Hugo Coding Style.
To be improved.
alpar [Mon, 03 May 2004 09:18:01 +0000] rev 506
Now it sucks the whole src/include and src/include/skeletons
instead of individual files.
athos [Mon, 03 May 2004 09:00:09 +0000] rev 505
I changed it to correspond changing requirements
alpar [Mon, 03 May 2004 08:13:41 +0000] rev 504
One more test case with minor importance.
alpar [Mon, 03 May 2004 07:27:29 +0000] rev 503
test/graph_test.cc added.
It discovered several bugs and warnings in 'include/smart_graph.h',
in 'include/skeletons/graph.h' and in 'work/alpar/list_graph.h'.
They have also been fixed.
marci [Fri, 30 Apr 2004 19:02:40 +0000] rev 502
static const bool BipartiteGraphWrapper<Graph>::S_CLASS, T_CLASS
marci [Fri, 30 Apr 2004 18:43:18 +0000] rev 501
bipatite
marci [Fri, 30 Apr 2004 17:48:50 +0000] rev 500
misc
marci [Fri, 30 Apr 2004 17:10:01 +0000] rev 499
A bipartite graph template can be used as BipartiteGraph<ListGraph>.
marci [Fri, 30 Apr 2004 16:46:19 +0000] rev 498
bipartite graphs
marci [Fri, 30 Apr 2004 16:10:49 +0000] rev 497
bipartite graph in bipartite_graph_wrapper.h
marci [Fri, 30 Apr 2004 14:02:10 +0000] rev 496
gw
marci [Fri, 30 Apr 2004 13:52:17 +0000] rev 495
(none)
jacint [Fri, 30 Apr 2004 06:46:39 +0000] rev 494
Felkesz kod!
klao [Fri, 30 Apr 2004 01:59:15 +0000] rev 493
DirPath fejlodes.
Kiserleti struktura a forditasi idoben kapcsolhato konzisztencia es range
ellenorzesekre.
klao [Fri, 30 Apr 2004 01:10:13 +0000] rev 492
spell checking
klao [Fri, 30 Apr 2004 01:02:22 +0000] rev 491
ingroup bug
klao [Thu, 29 Apr 2004 23:24:42 +0000] rev 490
The -W gcc option _does_ matter even if you use -Wall!
Minor changes.
klao [Thu, 29 Apr 2004 22:39:17 +0000] rev 489
Basic error handling facilities
(and possibly a g++-3.4.0 bug)
marci [Thu, 29 Apr 2004 19:38:53 +0000] rev 488
misc
marci [Thu, 29 Apr 2004 19:25:52 +0000] rev 487
some documentation
marci [Thu, 29 Apr 2004 18:48:25 +0000] rev 486
TODO
marci [Thu, 29 Apr 2004 17:34:42 +0000] rev 485
Some docu in MaxFlow class, jacint/max_flow.h
beckerjc [Thu, 29 Apr 2004 17:23:56 +0000] rev 484
Move unionfind.h in Doxyfile too
beckerjc [Thu, 29 Apr 2004 17:00:44 +0000] rev 483
UnionFind moved to include. Test compiles and runs cleanly.
* test/makefile:
minor cleanups
marci [Thu, 29 Apr 2004 16:59:00 +0000] rev 482
corrections for leda matching files
beckerjc [Thu, 29 Apr 2004 16:45:40 +0000] rev 481
Three new methods in UnionFindEnum.
UnionFindEnum completed.
marci [Thu, 29 Apr 2004 16:30:39 +0000] rev 480
corrections
alpar [Thu, 29 Apr 2004 16:29:43 +0000] rev 479
Main page added.
marci [Thu, 29 Apr 2004 16:26:01 +0000] rev 478
preflow.f -> max_flow.h
alpar [Thu, 29 Apr 2004 16:26:01 +0000] rev 477
doc
marci [Thu, 29 Apr 2004 16:25:03 +0000] rev 476
preflow, maxflow
marci [Thu, 29 Apr 2004 16:08:16 +0000] rev 475
edmonds_karp_demo->max_flow_demo
marci [Thu, 29 Apr 2004 16:07:10 +0000] rev 474
edmonds_karp
marci [Thu, 29 Apr 2004 16:04:27 +0000] rev 473
ledagraph
marci [Thu, 29 Apr 2004 15:58:34 +0000] rev 472
preflow, maxflow
marci [Thu, 29 Apr 2004 15:01:52 +0000] rev 471
misc
jacint [Thu, 29 Apr 2004 11:09:12 +0000] rev 470
Comparison == changed to <=
marci [Thu, 29 Apr 2004 10:51:58 +0000] rev 469
const-ok
marci [Thu, 29 Apr 2004 10:41:56 +0000] rev 468
nem irunk olyat hogy "void resetTarget(const Node _t) {t=_t;}" mert az a const az ott jobbara hulyeseg
marci [Thu, 29 Apr 2004 10:29:51 +0000] rev 467
preflow maxflow ...
marci [Thu, 29 Apr 2004 10:16:46 +0000] rev 466
preflow, maxflow comp
marci [Thu, 29 Apr 2004 09:08:14 +0000] rev 465
mods implied by preflow mods
alpar [Thu, 29 Apr 2004 08:42:05 +0000] rev 464
It breaks my heart to say them goodbye...
alpar [Thu, 29 Apr 2004 08:33:16 +0000] rev 463
doc
beckerjc [Wed, 28 Apr 2004 20:55:18 +0000] rev 462
Doc for the union-find structures.
marci [Wed, 28 Apr 2004 16:25:34 +0000] rev 461
bug ellen
marci [Wed, 28 Apr 2004 14:20:24 +0000] rev 460
test makefile hiba
marci [Wed, 28 Apr 2004 14:17:54 +0000] rev 459
dijstra const ref, misc
alpar [Wed, 28 Apr 2004 12:58:58 +0000] rev 458
Docs.
alpar [Wed, 28 Apr 2004 12:33:05 +0000] rev 457
\author's added
alpar [Wed, 28 Apr 2004 12:22:34 +0000] rev 456
Doxygen options changed.
\author's added.
marci [Wed, 28 Apr 2004 09:59:23 +0000] rev 455
for checking bipartiteness
marci [Wed, 28 Apr 2004 09:55:11 +0000] rev 454
makefile: nem veletlenul commit-oltam
jacint [Tue, 27 Apr 2004 23:01:15 +0000] rev 453
(none)
jacint [Tue, 27 Apr 2004 23:00:42 +0000] rev 452
(none)
jacint [Tue, 27 Apr 2004 22:59:15 +0000] rev 451
Changes in the interface and new test program added.
klao [Tue, 27 Apr 2004 22:29:11 +0000] rev 450
trifles
jacint [Tue, 27 Apr 2004 18:33:39 +0000] rev 449
debug
marci [Tue, 27 Apr 2004 16:27:08 +0000] rev 448
bfs, dfs, bfsiterator, dfsiterator for alpar's sake of being much more standardized.
marci [Tue, 27 Apr 2004 14:17:13 +0000] rev 447
misc
marci [Tue, 27 Apr 2004 14:10:19 +0000] rev 446
comparison for matchings with leda
klao [Tue, 27 Apr 2004 13:53:27 +0000] rev 445
Egy helyes (warning nelkuli) megvalositasa az operator<< -nek az stGraphWrapper
Node es Edge-enek. Csak a konverziok es templates fuggvenyek "alacsony
prioritasa" miatt hasznalhatatlan.
Magyarul az stGW::Node -ra jol mukodik, de a NodeIt-ra mar nem, pedig van hozza
konverzio. Csak akkor mar inkabb a ListGraph::Node-jara definialt nem
template-es fuggvenyt hasznalja.
jacint [Tue, 27 Apr 2004 13:47:05 +0000] rev 444
debug
klao [Tue, 27 Apr 2004 13:44:14 +0000] rev 443
* list_graph.h:
- node_item and edge_item are structs and not classes
- operator<< is inline
klao [Tue, 27 Apr 2004 13:35:09 +0000] rev 442
oops
marci [Tue, 27 Apr 2004 11:58:14 +0000] rev 441
makefile improvement in work/jacint
alpar [Tue, 27 Apr 2004 11:32:22 +0000] rev 440
doc trimming.
marci [Tue, 27 Apr 2004 11:04:35 +0000] rev 439
makefile
alpar [Tue, 27 Apr 2004 10:50:46 +0000] rev 438
The long description is now the description of the module.
jacint [Tue, 27 Apr 2004 10:27:34 +0000] rev 437
Testing preprocess.
marci [Tue, 27 Apr 2004 09:40:25 +0000] rev 436
gcc-3.4.0
marci [Tue, 27 Apr 2004 09:26:32 +0000] rev 435
misc
alpar [Tue, 27 Apr 2004 08:31:00 +0000] rev 434
Some more docs.
DirPath::Builder::setFist() added. (It is empty.)
marci [Tue, 27 Apr 2004 08:19:39 +0000] rev 433
g++-3.4.0, misc
alpar [Mon, 26 Apr 2004 18:22:34 +0000] rev 432
xy.h went to src/include.
alpar [Mon, 26 Apr 2004 18:16:42 +0000] rev 431
docs
alpar [Mon, 26 Apr 2004 18:08:46 +0000] rev 430
Many new modules (groups) in the documentation.
alpar [Mon, 26 Apr 2004 17:41:23 +0000] rev 429
Path of time_measure.h fixed.
alpar [Mon, 26 Apr 2004 17:39:38 +0000] rev 428
time_measure.h went to src/include.
klao [Mon, 26 Apr 2004 17:39:15 +0000] rev 427
Minor doc corrections
alpar [Mon, 26 Apr 2004 17:36:49 +0000] rev 426
Some more tests.
alpar [Mon, 26 Apr 2004 17:33:51 +0000] rev 425
Some more docs.
Put it into the 'misc' group.
alpar [Mon, 26 Apr 2004 17:31:49 +0000] rev 424
'misc' group added to the documentation
marci [Mon, 26 Apr 2004 17:10:27 +0000] rev 423
misc
jacint [Mon, 26 Apr 2004 17:05:22 +0000] rev 422
macro erase
marci [Mon, 26 Apr 2004 16:58:14 +0000] rev 421
For working with undirected graphs, head is changed to aNode.
Some dimacs doki.
marci [Mon, 26 Apr 2004 16:21:36 +0000] rev 420
leda comparison files
marci [Mon, 26 Apr 2004 16:08:46 +0000] rev 419
comparison with leda algorithms, wrapper for leda graphs
marci [Mon, 26 Apr 2004 16:02:09 +0000] rev 418
misc
marci [Mon, 26 Apr 2004 15:14:23 +0000] rev 417
Better control of gcc version
klao [Mon, 26 Apr 2004 14:52:51 +0000] rev 416
typo
marci [Mon, 26 Apr 2004 14:40:59 +0000] rev 415
for igcc-3.4.0
marci [Mon, 26 Apr 2004 14:25:51 +0000] rev 414
gcc-3.4.0
marci [Mon, 26 Apr 2004 14:19:19 +0000] rev 413
misc
alpar [Mon, 26 Apr 2004 11:11:55 +0000] rev 412
To be on the safe side...
marci [Mon, 26 Apr 2004 10:35:36 +0000] rev 411
misc
marci [Mon, 26 Apr 2004 09:55:31 +0000] rev 410
as you see...
marci [Mon, 26 Apr 2004 09:54:24 +0000] rev 409
stGraphWrapper is almost working
alpar [Mon, 26 Apr 2004 09:21:27 +0000] rev 408
Some more docs.
alpar [Mon, 26 Apr 2004 09:06:13 +0000] rev 407
The doc modules clearly needs some restructuring...
alpar [Mon, 26 Apr 2004 09:00:12 +0000] rev 406
Docs are now divided into modules.
alpar [Mon, 26 Apr 2004 08:07:53 +0000] rev 405
#define HUGO_SMART_GRAPH_H ---> #define HUGO_LIST_GRAPH_H
alpar [Mon, 26 Apr 2004 08:03:00 +0000] rev 404
More docs.
alpar [Sun, 25 Apr 2004 22:29:27 +0000] rev 403
Try to compile before commit, please.
alpar [Sun, 25 Apr 2004 22:28:19 +0000] rev 402
A missing conversion added
alpar [Sun, 25 Apr 2004 22:26:19 +0000] rev 401
Some bugfixes.
Some more docs.
alpar [Sun, 25 Apr 2004 20:16:16 +0000] rev 400
class NodeSet: A graph class with no edges
class EdgeSet: A graph class using the node set of another graph.
It compiles but untested and undocumented.
alpar [Sun, 25 Apr 2004 17:06:40 +0000] rev 399
The diffs in src/include/smart_graph.h between 528:529 was merged into
this file.
alpar [Sun, 25 Apr 2004 16:58:05 +0000] rev 398
A (non)bug was fixed.
Some more docs in SymSmartGraph.
alpar [Sun, 25 Apr 2004 16:53:38 +0000] rev 397
I hope it works. The 'erase' functions hasn't been tested yet.
alpar [Sun, 25 Apr 2004 14:25:04 +0000] rev 396
Some day this file will contain an erasable version of SmartGraph.
alpar [Sun, 25 Apr 2004 14:20:36 +0000] rev 395
For the future "node_set" and "edge_set" structures.
beckerjc [Sat, 24 Apr 2004 16:03:25 +0000] rev 394
New union-find structure with enumerable classes.
marci [Sat, 24 Apr 2004 15:19:17 +0000] rev 393
misc
marci [Sat, 24 Apr 2004 14:25:03 +0000] rev 392
g++-4.0
beckerjc [Sat, 24 Apr 2004 13:24:42 +0000] rev 391
StdMap compiles with 3.4
marci [Sat, 24 Apr 2004 12:53:46 +0000] rev 390
jacint mindig modosit, es ezert nekunk is kell
marci [Sat, 24 Apr 2004 12:44:41 +0000] rev 389
modifications for better compatibility with gcc 3.4.0
jacint [Fri, 23 Apr 2004 21:26:32 +0000] rev 388
ResGraphWrapper running time comparison test.
jacint [Fri, 23 Apr 2004 19:41:01 +0000] rev 387
Documentation added.
jacint [Fri, 23 Apr 2004 19:15:55 +0000] rev 386
aprosag
jacint [Fri, 23 Apr 2004 19:04:05 +0000] rev 385
Some changes in the documentation.
jacint [Fri, 23 Apr 2004 18:48:56 +0000] rev 384
Testfile for dijkstra.h, bin_heap.h and fib_heap.h
klao [Fri, 23 Apr 2004 16:48:54 +0000] rev 383
3.4.0-asban megszuntettek a bug-ot.
Egyaltalan nem hagyta leforditani a file-t, ha nem irtunk elet "typename" es
"template" kulcsszot.
Azota viszont mar a 3.3-as is gond nelkul forditja.
alpar [Fri, 23 Apr 2004 13:31:34 +0000] rev 382
(none)
marci [Fri, 23 Apr 2004 08:32:18 +0000] rev 381
misc
marci [Fri, 23 Apr 2004 08:08:41 +0000] rev 380
.
marci [Fri, 23 Apr 2004 07:41:48 +0000] rev 379
.
deba [Thu, 22 Apr 2004 20:36:21 +0000] rev 378
(none)
deba [Thu, 22 Apr 2004 16:36:57 +0000] rev 377
(none)
marci [Thu, 22 Apr 2004 16:07:17 +0000] rev 376
preflow mods
jacint [Thu, 22 Apr 2004 15:58:08 +0000] rev 375
(none)
jacint [Thu, 22 Apr 2004 15:56:05 +0000] rev 374
(none)
jacint [Thu, 22 Apr 2004 14:50:24 +0000] rev 373
Changes in the documentation.
jacint [Thu, 22 Apr 2004 14:11:28 +0000] rev 372
(none)
marci [Thu, 22 Apr 2004 13:59:37 +0000] rev 371
misc
jacint [Thu, 22 Apr 2004 13:51:25 +0000] rev 370
(none)
klao [Wed, 21 Apr 2004 23:47:01 +0000] rev 369
Directed path structure.
Proposal for a path building interface.
marci [Wed, 21 Apr 2004 20:48:00 +0000] rev 368
experimental bipartite graph wrapper
klao [Wed, 21 Apr 2004 19:52:09 +0000] rev 367
Remove function and some todos.
klao [Wed, 21 Apr 2004 19:10:59 +0000] rev 366
Test for the new style iter
klao [Wed, 21 Apr 2004 18:56:26 +0000] rev 365
Masikfele iteralas, Node-hoz alkalmazkodva...
marci [Wed, 21 Apr 2004 17:14:59 +0000] rev 364
dimacs.hh goes to oldies
klao [Wed, 21 Apr 2004 16:22:50 +0000] rev 363
Idezni csak pontosan, szepen, ahogy a csiga...
klao [Wed, 21 Apr 2004 16:09:42 +0000] rev 362
IterableMap: no range checking, no warning :)
klao [Wed, 21 Apr 2004 15:46:40 +0000] rev 361
IterableMap with template ValueType. IterableBoolMap as a specialization.
Range checking warnings...
marci [Wed, 21 Apr 2004 15:14:45 +0000] rev 360
work/marci/bfs_iterator.h BfsIterator5 -> BfsIterator, DfsIterator5 -> DfsIterator
marci [Wed, 21 Apr 2004 14:59:43 +0000] rev 359
misc
marci [Wed, 21 Apr 2004 14:50:42 +0000] rev 358
time comparison for bfs iterator and iterator by hand
alpar [Wed, 21 Apr 2004 12:36:53 +0000] rev 357
Requests for docs.
alpar [Wed, 21 Apr 2004 12:31:51 +0000] rev 356
.
alpar [Wed, 21 Apr 2004 08:14:44 +0000] rev 355
Folder for the test programs.
marci [Tue, 20 Apr 2004 13:43:36 +0000] rev 354
UndirListGraph, somebody should try it.
marci [Tue, 20 Apr 2004 12:10:36 +0000] rev 353
template first goes to comment...
beckerjc [Sat, 17 Apr 2004 21:50:48 +0000] rev 352
A successful work-around for using const map reference as an output
parameter to Kruskal().
alpar [Sat, 17 Apr 2004 19:54:04 +0000] rev 351
NullMap
beckerjc [Sat, 17 Apr 2004 19:34:43 +0000] rev 350
Maximum Adjacency Ordering (beta)
beckerjc [Sat, 17 Apr 2004 19:19:57 +0000] rev 349
Kruskal lenyegeben kesz.
Kell meg dokumentalni, meg meg egy par jol hasznalhato wrapper fv.
Es valamit meg kene csinalni azzal, hogy nem const ref. a kimeno boolmap,
viszont sokszor "on-the-fly" akarjuk megkonstrualni (es ilyenkor persze a
const-os mapet is lehet set-elni...)
alpar [Sat, 17 Apr 2004 13:15:53 +0000] rev 348
A bool Edge Map with iterators that goes through the true or the false edges.
klao [Sat, 17 Apr 2004 01:57:48 +0000] rev 347
A generic map with value type [0, N) where N is a small integer.
Can enumerate keys with a given value.
klao [Sat, 17 Apr 2004 01:50:23 +0000] rev 346
megsem volt bug
klao [Fri, 16 Apr 2004 23:00:09 +0000] rev 345
Misterious bug with StdMap::set (?)
Fixed default contstructor.
alpar [Fri, 16 Apr 2004 22:00:11 +0000] rev 344
Some cosmetic changes and spell checking.
alpar [Fri, 16 Apr 2004 21:35:25 +0000] rev 343
time_measure.h has been added to the doc.
graph_concept.h has been removed for it was confusing.
alpar [Fri, 16 Apr 2004 21:18:40 +0000] rev 342
An example for a readable/writeable but non-referrable map
without get() and set().
marci [Fri, 16 Apr 2004 17:39:19 +0000] rev 341
semmi
deba [Fri, 16 Apr 2004 13:42:03 +0000] rev 340
(none)
marci [Fri, 16 Apr 2004 13:26:15 +0000] rev 339
graph_wrapper.h, kicsi doksi. erdekes dolgokat rak az abrakadabra, nem is ertem
marci [Fri, 16 Apr 2004 13:05:08 +0000] rev 338
kicsit takaritottam, es szepitettem es, es maga a csuda, de azer nem
teljesen mer' meg kell csinalni vele dolgokat.
deba [Fri, 16 Apr 2004 12:15:17 +0000] rev 337
(none)
deba [Fri, 16 Apr 2004 12:13:07 +0000] rev 336
(none)
marci [Fri, 16 Apr 2004 08:26:00 +0000] rev 335
jflsjfljskf
marci [Thu, 15 Apr 2004 20:50:03 +0000] rev 334
brrr
marci [Thu, 15 Apr 2004 20:19:26 +0000] rev 333
makroizeles
marci [Thu, 15 Apr 2004 19:01:00 +0000] rev 332
.
athos [Thu, 15 Apr 2004 17:03:44 +0000] rev 331
Elkezdtem atirni a preflow_push-t. Csinaltam egy backupot graph wrapper nelkul (without gw, azaz wogw)
marci [Thu, 15 Apr 2004 14:41:20 +0000] rev 330
In the resgraphwrapper interface, and in the constructor,
the order of FlowMap and CapacityMap is changed.
alpar [Thu, 15 Apr 2004 08:06:43 +0000] rev 329
*** empty log message ***
alpar [Thu, 15 Apr 2004 08:00:17 +0000] rev 328
Spell chechking
alpar [Thu, 15 Apr 2004 06:49:49 +0000] rev 327
Documentation.
alpar [Thu, 15 Apr 2004 05:51:12 +0000] rev 326
Deprecated...
marci [Wed, 14 Apr 2004 20:57:58 +0000] rev 325
kiserletezek a concept-leirassal, skeleton kereteben, ha kesz lesz majd szolok
alpar [Wed, 14 Apr 2004 16:16:40 +0000] rev 324
Naming conventions...
marci [Wed, 14 Apr 2004 13:57:48 +0000] rev 323
gw, kiszedtem ami nem kell
athos [Wed, 14 Apr 2004 13:30:05 +0000] rev 322
The paths are stored in vectors, assumed there is no circle of length 0
alpar [Wed, 14 Apr 2004 12:24:55 +0000] rev 321
Some concerns about the copy constructors of graph.h